- Bishop's Mathematics: a Philosophical Perspective.Laura Crosilla - forthcoming - In Handbook of Bishop's Mathematics. CUP.details
|
|
Truth, Pretense and the Liar Paradox.Bradley Armour-Garb & James A. Woodbridge - 2015 - In T. Achourioti, H. Galinon, J. Martínez Fernández & K. Fujimoto (eds.), Unifying the Philosophy of Truth. Dordrecht: Imprint: Springer. pp. 339-354.details
|
|
Glueing of analysis models in an intuitionistic setting.D. Dalen - 1986 - Studia Logica 45 (2):181 - 186.details
|
|
The axiom of choice and combinatory logic.Andrea Cantini - 2003 - Journal of Symbolic Logic 68 (4):1091-1108.details
|
|
Recursive models for constructive set theories.N. Beeson - 1982 - Annals of Mathematical Logic 23 (2/3):127.details
|
|
Recursive models for constructive set theories.M. Beeson - 1982 - Annals of Mathematical Logic 23 (2-3):127-178.details
|
|
Principles of continuous choice and continuity of functions in formal systems for constructive mathematics.Michael J. Beeson - 1977 - Annals of Mathematical Logic 12 (3):249.details
|
|
Explicit provability and constructive semantics. [REVIEW]Jeremy D. Avigad - 2002 - Bulletin of Symbolic Logic 8 (3):432-432.details
|
|
The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory.Michael Rathjen - 2005 - Synthese 147 (1):81-120.details
|
|
Analysis and Interpretation in the Exact Sciences: Essays in Honour of William Demopoulos.Melanie Frappier, Derek Brown & Robert DiSalle (eds.) - 2011 - Dordrecht and London: Springer.details
|
|
Property Theories.George Bealer & Uwe Mönnich - 1983 - In Dov M. Gabbay & Franz Guenthner (eds.), Handbook of Philosophical Logic. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 133-251.details
|
|
Unifying the Philosophy of Truth.Theodora Achourioti, Henri Galinon, José Martínez Fernández & Kentaro Fujimoto (eds.) - 2015 - Dordrecht, Netherland: Springer.details
|
|
Glueing of Analysis Models in an Intuitionistic Setting.D. van Dalen - 1986 - Studia Logica 45 (2):181-186.details
|
|
Monotone inductive definitions in a constructive theory of functions and classes.Shuzo Takahashi - 1989 - Annals of Pure and Applied Logic 42 (3):255-297.details
|
|
Explicit mathematics: power types and overloading.Thomas Studer - 2005 - Annals of Pure and Applied Logic 134 (2-3):284-302.details
|
|
The non-constructive μ operator, fixed point theories with ordinals, and the bar rule.Thomas Strahm - 2000 - Annals of Pure and Applied Logic 104 (1-3):305-324.details
|
|
Well-ordering proofs for Martin-Löf type theory.Anton Setzer - 1998 - Annals of Pure and Applied Logic 92 (2):113-159.details
|
|
A new model construction by making a detour via intuitionistic theories I: Operational set theory without choice is Π 1 -equivalent to KP.Kentaro Sato & Rico Zumbrunnen - 2015 - Annals of Pure and Applied Logic 166 (2):121-186.details
|
|
A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T 0.Kentaro Sato - 2015 - Annals of Pure and Applied Logic 166 (7-8):800-835.details
|
|
Extended bar induction in applicative theories.Gerard R. Renardel de Lavalette - 1990 - Annals of Pure and Applied Logic 50 (2):139-189.details
|
|
Recent Advances in Ordinal Analysis: Π 1 2 — CA and Related Systems. [REVIEW]Michael Rathjen - 1995 - Bulletin of Symbolic Logic 1 (4):468-485.details
|
|
Recent Advances in Ordinal Analysis: Π 1 2 — CA and Related Systems. [REVIEW]Michael Rathjen - 1995 - Bulletin of Symbolic Logic 1 (4):468-485.details
|
|
Replacement versus collection and related topics in constructive Zermelo–Fraenkel set theory.Michael Rathjen - 2005 - Annals of Pure and Applied Logic 136 (1-2):156-174.details
|
|
The provably terminating operations of the subsystem of explicit mathematics.Dieter Probst - 2011 - Annals of Pure and Applied Logic 162 (11):934-947.details
|
|
Admissible closures of polynomial time computable arithmetic.Dieter Probst & Thomas Strahm - 2011 - Archive for Mathematical Logic 50 (5):643-660.details
|
|
Pure Proof Theory. Mathematicians are interested in structures. There is only one way to find the theorems of a structure. Start with an axiom system for the structure and deduce the theorems logically. These axiom systems are the objects of proof-theoretical research. Studying axiom systems there is a series of more. [REVIEW]Wolfram Pohlers - 1996 - Bulletin of Symbolic Logic 2 (2):159-188.details
|
|
Realizability and recursive set theory.Charles McCarty - 1986 - Annals of Pure and Applied Logic 32:153-183.details
|
|
The Groundedness Approach to Class Theory.Jönne Kriener - 2014 - Inquiry: An Interdisciplinary Journal of Philosophy 57 (2):244-273.details
|
|
On uniform weak König's lemma.Ulrich Kohlenbach - 2002 - Annals of Pure and Applied Logic 114 (1-3):103-116.details
|
|
Universes over Frege structures.Reinhard Kahle - 2003 - Annals of Pure and Applied Logic 119 (1-3):191-223.details
|
|
Truth in applicative theories.Reinhard Kahle - 2001 - Studia Logica 68 (1):103-128.details
|
|
Mathematical proof theory in the light of ordinal analysis.Reinhard Kahle - 2002 - Synthese 133 (1/2):237 - 255.details
|
|
Applicative theories for the polynomial hierarchy of time and its levels.Reinhard Kahle & Isabel Oitavem - 2013 - Annals of Pure and Applied Logic 164 (6):663-675.details
|
|
Totality in applicative theories.Gerhard Jäger & Thomas Strahm - 1995 - Annals of Pure and Applied Logic 74 (2):105-120.details
|
|
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories.Gerhard Jäger & Dieter Probst - 2011 - Annals of Pure and Applied Logic 162 (8):647-660.details
|
|
Universes in explicit mathematics.Gerhard Jäger, Reinhard Kahle & Thomas Studer - 2001 - Annals of Pure and Applied Logic 109 (3):141-162.details
|
|
On Feferman’s operational set theory OST.Gerhard Jäger - 2007 - Annals of Pure and Applied Logic 150 (1-3):19-39.details
|
|
Reflections on reflections in explicit mathematics.Gerhard Jäger & Thomas Strahm - 2005 - Annals of Pure and Applied Logic 136 (1-2):116-133.details
|
|
Extending the system T0 of explicit mathematics: the limit and Mahlo axioms.Gerhard Jäger & Thomas Studer - 2002 - Annals of Pure and Applied Logic 114 (1-3):79-101.details
|
|
Full operational set theory with unbounded existential quantification and power set.Gerhard Jäger - 2009 - Annals of Pure and Applied Logic 160 (1):33-52.details
|
|
Grounded Ungroundedness.Casper Storm Hansen - 2014 - Inquiry: An Interdisciplinary Journal of Philosophy 57 (2):216-243.details
|
|
Proof-theoretical analysis: weak systems of functions and classes.L. Gordeev - 1988 - Annals of Pure and Applied Logic 38 (1):1-121.details
|
|
Proof-theoretic conservations of weak weak intuitionistic constructive set theories.Lev Gordeev - 2013 - Annals of Pure and Applied Logic 164 (12):1274-1292.details
|
|
Embeddings between Partial Combinatory Algebras.Anton Golov & Sebastiaan A. Terwijn - 2023 - Notre Dame Journal of Formal Logic 64 (1):129-158.details
|
|
Understanding uniformity in Feferman's explicit mathematics.Thomas Glaß - 1995 - Annals of Pure and Applied Logic 75 (1-2):89-106.details
|
|
Systems of explicit mathematics with non-constructive μ-operator and join.Thomas Glaß & Thomas Strahm - 1996 - Annals of Pure and Applied Logic 82 (2):193-219.details
|
|
A type reduction from proof-conditional to dynamic semantics.Tim Fernando - 2001 - Journal of Philosophical Logic 30 (2):121-153.details
|
|
Working foundations.Solomon Feferman - 1985 - Synthese 62 (2):229 - 254.details
|
|
Systems of explicit mathematics with non-constructive μ-operator. Part II.Solomon Feferman & Gerhard Jäger - 1996 - Annals of Pure and Applied Logic 79 (1):37-52.details
|
|
Systems of explicit mathematics with non-constructive μ-operator. Part I.Solomon Feferman & Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 65 (3):243-263.details
|
|