On \(\mathsf{Q}\)
From MaRDI portal
Publication:1699730
DOI10.1007/s00500-016-2341-5zbMath1420.03143OpenAlexW2914888325MaRDI QIDQ1699730
Publication date: 23 February 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-016-2341-5
Related Items (10)
Friedman-reflexivity ⋮ Finitely axiomatized theories lack self‐comprehension ⋮ There are no minimal effectively inseparable theories ⋮ WHAT IS A RESTRICTIVE THEORY? ⋮ A note on uniform density in weak arithmetical theories ⋮ ON A QUESTION OF KRAJEWSKI’S ⋮ The Thomsen-Bachmann correspondence in metric geometry. I ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ FINDING THE LIMIT OF INCOMPLETENESS I ⋮ On decidability and axiomatizability of some ordered structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairs, sets and sequences in first-order theories
- The sum of irreducible fractions with consecutive denominators is never an integer in \(\mathrm{PA}^-\)
- Interpretability degrees of finitely axiomatized sequential theories
- The Green-Tao theorem on primes in arithmetical progressions in the positive cone of \(\mathbb Z [X\)]
- Undecidable theories
- Sequence encoding without induction
- Vaught's Theorem on Axiomatizability by a Scheme
- A lattice of chapters of mathematics (interpretations between theorems [theories)]
- Cuts, consistency statements and interpretations
- Sequential theories and infinite distributivity in the lattice of chapters
- Gödel's Second incompleteness theorem for Q
- Variants of Robinson's essentially undecidable theoryR
- Some Prime Elements in the Lattice of Interpretability Types
- Schatunowsky's theorem, Bonse's inequality, and Chebyshev's theorem in weak fragments of Peano arithmetic
- Deduction-preserving "Recursive Isomorphisms" between theories
This page was built for publication: On \(\mathsf{Q}\)
