- (1 other version)The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.details
|
|
Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.details
|
|
Axiomatic theories of truth.Volker Halbach - 2008 - Stanford Encyclopedia of Philosophy.details
|
|
Tarski on “essentially richer” metalanguages.David DeVidi & Graham Solomon - 1999 - Journal of Philosophical Logic 28 (1):1-28.details
|
|
Bounded finite set theory.Laurence Kirby - 2021 - Mathematical Logic Quarterly 67 (2):149-163.details
|
|
(Extra)Ordinary Equivalences with the Ascending/Descending Sequence Principle.Marta Fiori-Carones, Alberto Marcone, Paul Shafer & Giovanni Soldà - 2024 - Journal of Symbolic Logic 89 (1):262-307.details
|
|
Is the HYPE about strength warranted?Martin Fischer - 2022 - Synthese 200 (3):1-25.details
|
|
The Potential in Frege’s Theorem.Will Stafford - 2023 - Review of Symbolic Logic 16 (2):553-577.details
|
|
Tanaka’s theorem revisited.Saeideh Bahrami - 2020 - Archive for Mathematical Logic 59 (7-8):865-877.details
|
|
Intermediate Logics and the de Jongh property.Dick Jongh, Rineke Verbrugge & Albert Visser - 2011 - Archive for Mathematical Logic 50 (1-2):197-213.details
|
|
The Strength of Abstraction with Predicative Comprehension.Sean Walsh - 2016 - Bulletin of Symbolic Logic 22 (1):105–120.details
|
|
Empiricism, Probability, and Knowledge of Arithmetic.Sean Walsh - 2014 - Journal of Applied Logic 12 (3):319–348.details
|
|
On Overspill Principles and Axiom Schemes for Bounded Formulas.Joaquín Borrego-Díaz, Alejandro Fernández-Margarit & Mario Pérez-Jiménez - 1996 - Mathematical Logic Quarterly 42 (1):341-348.details
|
|
Maximum Schemes in Arithmetic.A. Fernández-Margarit & M. J. Pérez-Jiménez - 1994 - Mathematical Logic Quarterly 40 (3):425-430.details
|
|
An algebraic treatment of quantifier-free systems of arithmetic.Franco Montagna - 1996 - Archive for Mathematical Logic 35 (4):209-224.details
|
|
Conservative fragments of $${{S}^{1}{2}}$$ and $${{R}^{1}{2}}$$. [REVIEW]Chris Pollett - 2011 - Archive for Mathematical Logic 50 (3):367-393.details
|
|
Vaught's theorem on axiomatizability by a scheme.Albert Visser - 2012 - Bulletin of Symbolic Logic 18 (3):382-402.details
|
|
Hilbert's programme and gödel's theorems.Karl-Georg Niebergall & Matthias Schirn - 2002 - Dialectica 56 (4):347–370.details
|
|
Delineating classes of computational complexity via second order theories with weak set existence principles. I.Aleksandar Ignjatović - 1995 - Journal of Symbolic Logic 60 (1):103-121.details
|
|
Standard Formalization.Jeffrey Ketland - 2022 - Axiomathes 32 (3):711-748.details
|
|
A theory of implicit commitment.Mateusz Łełyk & Carlo Nicolai - 2022 - Synthese 200 (4):1-26.details
|
|
XV—On Consistency and Existence in Mathematics.Walter Dean - 2021 - Proceedings of the Aristotelian Society 120 (3):349-393.details
|
|
Finite sets and infinite sets in weak intuitionistic arithmetic.Takako Nemoto - 2020 - Archive for Mathematical Logic 59 (5-6):607-657.details
|
|
Randomness notions and reverse mathematics.André Nies & Paul Shafer - 2020 - Journal of Symbolic Logic 85 (1):271-299.details
|
|
Reverse mathematics of the finite downwards closed subsets of ordered by inclusion and adjacent Ramsey for fixed dimension.Florian Pelupessy - 2018 - Mathematical Logic Quarterly 64 (3):178-182.details
|
|
A Model‐Theoretic Property of Sharply Bounded Formulae, with some Applications.Jan Johannsen - 1998 - Mathematical Logic Quarterly 44 (2):205-215.details
|
|
Pairs, sets and sequences in first-order theories.Albert Visser - 2008 - Archive for Mathematical Logic 47 (4):299-326.details
|
|
Consistency statements and iterations of computable functions in IΣ1 and PRA.Joost J. Joosten - 2010 - Archive for Mathematical Logic 49 (7-8):773-798.details
|
|
On the relationship between ATR 0 and.Jeremy Avigad - 1996 - Journal of Symbolic Logic 61 (3):768-779.details
|
|
(1 other version)Self-verifying axiom systems, the incompleteness theorem and related reflection principles.Dan Willard - 2001 - Journal of Symbolic Logic 66 (2):536-596.details
|
|
How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic Q.Dan E. Willard - 2002 - Journal of Symbolic Logic 67 (1):465-496.details
|
|
Interpretability degrees of finitely axiomatized sequential theories.Albert Visser - 2014 - Archive for Mathematical Logic 53 (1-2):23-42.details
|
|
Friedman-reflexivity.Albert Visser - 2022 - Annals of Pure and Applied Logic 173 (9):103160.details
|
|
(2 other versions)Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.details
|
|
(2 other versions)Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.details
|
|
Münchhausen provability.Joost J. Joosten - 2021 - Journal of Symbolic Logic 86 (3):1006-1034.details
|
|
Isomorphisms of Diagonalizable Algebras.V. Yu Shavrukov - 1997 - Theoria 63 (3):210-221.details
|
|
Honest elementary degrees and degrees of relative provability without the cupping property.Paul Shafer - 2017 - Annals of Pure and Applied Logic 168 (5):1017-1031.details
|
|
Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts.Kentaro Sato - 2022 - Archive for Mathematical Logic 61 (3):399-435.details
|
|
Realizability semantics for quantified modal logic: Generalizing flagg’s 1985 construction.Benjamin G. Rin & Sean Walsh - 2016 - Review of Symbolic Logic 9 (4):752-809.details
|
|
The prehistory of the subsystems of second-order arithmetic.Walter Dean & Sean Walsh - 2017 - Review of Symbolic Logic 10 (2):357-396.details
|
|
A note on uniform density in weak arithmetical theories.Duccio Pianigiani & Andrea Sorbi - 2020 - Archive for Mathematical Logic 60 (1):211-225.details
|
|
Monomial ideals and independence of.Florian Pelupessy - 2017 - Mathematical Logic Quarterly 63 (1-2):59-65.details
|
|
First-order reasoning and efficient semi-algebraic proofs.Fedor Part, Neil Thapen & Iddo Tzameret - 2025 - Annals of Pure and Applied Logic 176 (1):103496.details
|
|
The Implicit Commitment of Arithmetical Theories and Its Semantic Core.Carlo Nicolai & Mario Piazza - 2019 - Erkenntnis 84 (4):913-937.details
|
|
(1 other version)Gaps, gluts, and theoretical equivalence.Carlo Nicolai - 2022 - Synthese 200 (5):1-22.details
|
|
Equivalences for Truth Predicates.Carlo Nicolai - 2017 - Review of Symbolic Logic 10 (2):322-356.details
|
|
Stable and Unstable Theories of Truth and Syntax.Beau Madison Mount & Daniel Waxman - 2021 - Mind 130 (518):439-473.details
|
|
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.details
|
|
Short propositional refutations for dense random 3CNF formulas.Sebastian Müller & Iddo Tzameret - 2014 - Annals of Pure and Applied Logic 165 (12):1864-1918.details
|
|