Copertina

Incompleteness for stably computable formal systems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Savelyev, Yasha
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Logic Logic in Computer Science
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Incompleteness theorems via Turing category
di: Savelyev, Yasha
Pubblicazione: (2024)

Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
di: Livson, Ori, et al.
Pubblicazione: (2025)

PECR: A formal system based on computability logic
di: Pantelis, G.
Pubblicazione: (2024)

Gödel Incompleteness Theorem for PAC Learnable Theory from the view of complexity measurement
di: Ma, Zhifeng, et al.
Pubblicazione: (2024)

Speedability of computably approximable reals and their approximations
di: Barmpalias, George, et al.
Pubblicazione: (2026)

Countability constraints in order-theoretic approaches to computability
di: Hack, Pedro, et al.
Pubblicazione: (2022)

Strong negation in the theory of computable functionals TCF
di: Köpp, Nils, et al.
Pubblicazione: (2022)

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

Indivisibility and uniform computational strength
di: Gill, Kenneth
Pubblicazione: (2023)

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

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

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

Modelling of logical systems by means of their fragments
di: Rybakov, Mikhail
Pubblicazione: (2025)

Towards solid abelian groups: A formal proof of Nöbeling's theorem
di: Asgeirsson, Dagur
Pubblicazione: (2023)

Wider systems for linear logic with fixed points: proof theory and complexity
di: Das, Anupam, et al.
Pubblicazione: (2026)

Generalisation of proof simulation procedures for Frege systems by M.L.~Bonet and S.R.~Buss
di: Kozhemiachenko, Daniil
Pubblicazione: (2024)

A study for recovering the cut-elimination property in cyclic proof systems by restricting the arity of inductive predicates
di: Oda, Yukihiro, et al.
Pubblicazione: (2022)

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
di: Oda, Yukihiro
Pubblicazione: (2025)

Relating homotopy equivalences to conservativity in dependent type theories with computation axioms
di: Spadetto, Matteo
Pubblicazione: (2023)

Effective weak convergence and tightness of measures in computable Polish spaces
di: Rojas, Diego A.
Pubblicazione: (2024)

A formalization of the Gelfond-Schneider theorem
di: Karatarakis, Michail, et al.
Pubblicazione: (2026)

A simple formalization of alpha-equivalence
di: Apinis, Kalmer, et al.
Pubblicazione: (2025)

Toward a formalization of artifacts in GFO
di: Fiegenbaum, Hanna
Pubblicazione: (2024)

Dependence Logics in Temporal Settings
di: Baltag, Alexandru, et al.
Pubblicazione: (2022)

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
di: Lichter, Moritz
Pubblicazione: (2022)

On proving consistency of equational theories in Bounded Arithmetic
di: Beckmann, Arnold, et al.
Pubblicazione: (2022)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
di: Gheorghiu, Alexander V., et al.
Pubblicazione: (2022)

Demystifying $μ$
di: Afshari, Bahareh, et al.
Pubblicazione: (2024)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
di: Artale, Alessandro, et al.
Pubblicazione: (2025)

Proof-theoretic Semantics for Second-order Logic
di: Gheorghiu, Alexander V., et al.
Pubblicazione: (2025)

List types for resource aware languages: an implicit name approach
di: Ghilezan, Silvia, et al.
Pubblicazione: (2021)

Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
di: Afshari, Bahareh, et al.
Pubblicazione: (2024)

Many-valued coalgebraic dynamic logics: Safety and strong completeness via reducibility
di: Hansen, Helle Hvid, et al.
Pubblicazione: (2025)

Generalized Decidability via Brouwer Trees
di: de Jong, Tom, et al.
Pubblicazione: (2026)

Constructive higher sheaf models with applications to synthetic mathematics
di: Coquand, Thierry, et al.
Pubblicazione: (2026)

Bijective proofs for Eulerian numbers of types B and D
di: Santocanale, Luigi
Pubblicazione: (2021)

On the logical structure of some maximality and well-foundedness principles equivalent to choice principles
di: Herbelin, Hugo
Pubblicazione: (2024)

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

The strength of the dominance rule
di: Kołodziejczyk, Leszek Aleksander, et al.
Pubblicazione: (2024)

Dynamic Probability Logic: Decidability & Computability
di: Chopoghloo, Somayeh, et al.
Pubblicazione: (2024)