The small‐is‐very‐small principle

DOI10.1002/malq.201800088OpenAlexW2996529146MaRDI QIDQ5108874

Albert Visser

Publication date: 6 May 2020

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.01178

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Gödel numberings and issues of incompleteness (03F40)

Related Items (3)

Friedman-reflexivity ⋮ Extension and interpretability ⋮ Finitely axiomatized theories lack self‐comprehension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The unprovability of small inconsistency. A study of local and global interpretability
• Faith \& falsity
• Harvey Friedman's research on the foundations of mathematics
• On the scheme of induction for bounded arithmetic formulas
• The arithmetics of a theory
• Interpretability degrees of finitely axiomatized sequential theories
• The role of quantifier alternations in cut elimination
• Sequence encoding without induction
• HUME’S PRINCIPLE, BEGINNINGS
• Can We Make the Second Incompleteness Theorem Coordinate Free?
• EXISTENTIALLY CLOSED MODELS IN THE FRAMEWORK OF ARITHMETIC
• A lattice of chapters of mathematics (interpretations between theorems [theories)]
• CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MÜNCHHAUSEN
• Cuts, consistency statements and interpretations
• A note on proofs of falsehood
• The disjunction property implies the numerical existence property
• Completeness Theorems, Incompleteness Theorems and Models of Arithmetic
• ON A QUESTION OF KRAJEWSKI’S
• Some Prime Elements in the Lattice of Interpretability Types
• The Interpretation Existence Lemma
• Computer Science Logic
• Satisfaction relations for proper classes: Applications in logic and set theory
• Cut Elimination In Situ

This page was built for publication: The small‐is‐very‐small principle