Axiomatizability by a schema
From MaRDI portal
Publication:5585387
DOI10.2307/2270175zbMath0191.29303OpenAlexW2030109211MaRDI QIDQ5585387
Publication date: 1967
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270175
Related Items (18)
Sequence encoding without induction ⋮ Friedman-reflexivity ⋮ On the degrees of unsolvability of modal predicate logics of provability ⋮ The theory of hereditarily bounded sets ⋮ There are no minimal effectively inseparable theories ⋮ AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW ⋮ The second incompleteness theorem and bounded interpretations ⋮ More on Systems of Truth and Predicative Comprehension ⋮ Pairs, sets and sequences in first-order theories ⋮ Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories ⋮ A lattice of interpretability types of theories ⋮ On expandability of models of Peano arithmetic. III ⋮ THE PERIPATETIC PROGRAM IN CATEGORICAL LOGIC: LEIBNIZ ON PROPOSITIONAL TERMS ⋮ CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MÜNCHHAUSEN ⋮ Finite mathematics. ⋮ Weak sequential theories of finite full binary trees ⋮ Cuts, consistency statements and interpretations ⋮ A note on typed truth and consistency assertions
This page was built for publication: Axiomatizability by a schema
