On Q

DOI10.1007/S00500-016-2341-5MaRDI QIDQ1699730zbMATH OpenOpenAlexFDO

Authors Albert Visser

Publication date 23 February 2018

Published in Soft Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00500-016-2341-5

zbMATH Keywords

\(\mathsf{PA}^-\)\(\mathsf{Q}\)arithmeticcomparison of theoriesinterpretabilityweak theories

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Recommendations

• An interpretation of Robinson arithmetic in its Grzegorczyk's weaker variant
• Relatives of Robinson arithmetic
• A minimal predicative set theory
• On partial disjunction properties of theories containing Peano arithmetic
• On interpretability in the theory of concatenation

Cites work

• A lattice of chapters of mathematics (interpretations between theorems [theories])
• An interpretation of Robinson arithmetic in its Grzegorczyk's weaker variant
• Cuts, consistency statements and interpretations
• Deduction-preserving "Recursive Isomorphisms" between theories
• Gödel's Second incompleteness theorem for Q
• scientific article; zbMATH DE number 1805574 (Why is no real title available?)
• scientific article; zbMATH DE number 51556 (Why is no real title available?)
• scientific article; zbMATH DE number 3999883 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• scientific article; zbMATH DE number 3285224 (Why is no real title available?)
• scientific article; zbMATH DE number 3349803 (Why is no real title available?)
• Interpretability degrees of finitely axiomatized sequential theories
• Pairs, sets and sequences in first-order theories
• Schatunowsky's theorem, Bonse's inequality, and Chebyshev's theorem in weak fragments of Peano arithmetic
• Sequence encoding without induction
• Sequential theories and infinite distributivity in the lattice of chapters
• Some Prime Elements in the Lattice of Interpretability Types
• The Green-Tao theorem on primes in arithmetical progressions in the positive cone of \(\mathbb Z [X]\)
• The sum of irreducible fractions with consecutive denominators is never an integer in \(\mathrm{PA}^-\)
• Undecidable theories
• Variants of Robinson's essentially undecidable theoryR
• Vaught's theorem on axiomatizability by a scheme
• What is sequentiality?
• Why the theory R is special

Cited in

(19)

• Friedman-reflexivity
• A note on uniform density in weak arithmetical theories
• On decidability and axiomatizability of some ordered structures
• On a question of Krajewski's
• Current research on Gödel's incompleteness theorems
• Finding the limit of incompleteness. I
• Finitely axiomatized theories lack self‐comprehension
• There are no minimal effectively inseparable theories
• WHAT IS A RESTRICTIVE THEORY?
• Essential hereditary undecidability
• Incompleteness of boundedly axiomatizable theories
• Pour-El's landscape
• The Thomsen-Bachmann correspondence in metric geometry. I
• Adventures in Gödel Incompleteness
• Certified _1-sentences
• On Rosser theories
• The limitless first incompleteness theorem
• Mathematical developments of the incompleteness theorems
• The Borel complexity of the class of models of first-order theories

This page was built for publication: On \(\mathsf{Q}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699730)