Image de couverture de livre

Countability constraints in order-theoretic approaches to computability

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hack, Pedro, Braun, Daniel A., Gottwald, Sebastian
Format:	Preprint
Publié:	2022
Sujets:	Logic Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Order-theoretic models for decision-making: Learning, optimization, complexity and computation
par: Hack, Pedro
Publié: (2024)

Proof-theoretic Semantics for Second-order Logic
par: Gheorghiu, Alexander V., et autres
Publié: (2025)

Proof-theoretic Semantics for First-order Logic
par: Gheorghiu, Alexander V.
Publié: (2024)

A proof-theoretic approach to abstract interpretation
par: D'Silva, Vijay, et autres
Publié: (2026)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
par: Gaßner, Christine
Publié: (2025)

Abstract computation over first-order structures. Part IIb: Moschovakis' operator and other non-determinisms
par: Gaßner, Christine
Publié: (2025)

Abstract computation over first-order structures. Part I: Deterministic and non-deterministic BSS RAMs
par: Gaßner, Christine
Publié: (2025)

Proof-theoretic Semantics for the Logic of Bunched Implications
par: Gu, Tao, et autres
Publié: (2023)

Proof-theoretic Semantics for Classical Propositional Logic with Assertion and Denial
par: Gheorghiu, Alexander V., et autres
Publié: (2025)

Decidability of MSO Reparameterization over Countable Chains
par: Rabinovich, Alexander
Publié: (2026)

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic (Extended Abstract)
par: Gheorghiu, Alexander V., et autres
Publié: (2023)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
par: Gheorghiu, Alexander V., et autres
Publié: (2022)

A comparison of three kinds of monotonic proof-theoretic semantics and the base-incompleteness of intuitionistic logic
par: d'Aragona, Antonio Piccolomini
Publié: (2025)

Incompleteness for stably computable formal systems
par: Savelyev, Yasha
Publié: (2022)

Speedability of computably approximable reals and their approximations
par: Barmpalias, George, et autres
Publié: (2026)

Strong negation in the theory of computable functionals TCF
par: Köpp, Nils, et autres
Publié: (2022)

The complete classification for quantified equality constraints
par: Zhuk, Dmitriy, et autres
Publié: (2021)

Rethinking the notion of oracle: A prequel to Lawvere-Tierney topologies for computability theorists
par: Kihara, Takayuki
Publié: (2022)

On semantics of first-order justification logic with binding modalities
par: Yavorskaya, Tatiana, et autres
Publié: (2025)

Indivisibility and uniform computational strength
par: Gill, Kenneth
Publié: (2023)

First-order Logic with Being a Thesis Modal Operator
par: Łyczak, Marcin
Publié: (2024)

The proof theory and semantics of second-order (intuitionistic) tense logic
par: Becker, Justus, et autres
Publié: (2026)

A modal approach towards substitutions
par: Tu, Yaxin, et autres
Publié: (2025)

A linear proof language for second-order intuitionistic linear logic
par: Díaz-Caro, Alejandro, et autres
Publié: (2023)

On the expressive power of inquisitive team logic and inquisitive first-order logic
par: Kontinen, Juha, et autres
Publié: (2026)

The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
par: Oda, Yukihiro, et autres
Publié: (2021)

List types for resource aware languages: an implicit name approach
par: Ghilezan, Silvia, et autres
Publié: (2021)

Model-theoretic Forcing in Transition Algebra
par: Hashimoto, Go, et autres
Publié: (2025)

A set-theoretical approach for ABox reasoning services (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2017)

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
par: Powell, Thomas
Publié: (2023)

Terminal Coalgebras in Countably Many Steps
par: Adámek, Jiří, et autres
Publié: (2023)

An ecumenical view of proof-theoretic semantics
par: Nascimento, Victor, et autres
Publié: (2023)

Decomposing graphs into stable and ordered parts
par: Buffière, Hector, et autres
Publié: (2025)

On first-order transductions of classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

A proof-theoretical approach to some extensions of first order quantification
par: Allègre, Loïc, et autres
Publié: (2024)

A proof-theoretic approach to uniform interpolation property of multi-agent modal logic
par: Su, Youan
Publié: (2025)

Making first order linear logic a generating grammar
par: Slavnov, Sergey
Publié: (2022)

Characterizations of monadically dependent tree-ordered weakly sparse structures
par: Buffière, Hector, et autres
Publié: (2026)

An order out of nowhere: a new algorithm for infinite-domain CSPs
par: Mottet, Antoine, et autres
Publié: (2023)

The Category of Iterative Sets in Homotopy Type Theory and Univalent Foundations
par: Gratzer, Daniel, et autres
Publié: (2024)