Axiomatizability by a schema
From MaRDI portal
Publication:5585387
Cited in
(19)- Pour-El's landscape
- Friedman-reflexivity
- The second incompleteness theorem and bounded interpretations
- Weak sequential theories of finite full binary trees
- The peripatetic program in categorical logic: Leibniz on propositional terms
- Peano Corto and Peano Basso: a study of local induction in the context of weak theories
- Pairs, sets and sequences in first-order theories
- Finite mathematics.
- AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
- More on Systems of Truth and Predicative Comprehension
- Cuts, consistency statements and interpretations
- On expandability of models of Peano arithmetic. III
- Sequence encoding without induction
- CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MÜNCHHAUSEN
- A note on typed truth and consistency assertions
- On the degrees of unsolvability of modal predicate logics of provability
- The theory of hereditarily bounded sets
- A lattice of interpretability types of theories
- There are no minimal effectively inseparable theories
This page was built for publication: Axiomatizability by a schema
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5585387)