- On Representations of Intended Structures in Foundational Theories.Neil Barton, Moritz Müller & Mihai Prunescu - 2022 - Journal of Philosophical Logic 51 (2):283-296.details
|
|
Mathematical Logic: On Numbers, Sets, Structures, and Symmetry.Roman Kossak - 2018 - Cham, Switzerland: Springer Verlag.details
|
|
Mathematical Generality, Letter-Labels, and All That.F. Acerbi - 2020 - Phronesis 65 (1):27-75.details
|
|
Probabilistic logic of quantum observations.A. Sernadas, J. Rasga, C. Sernadas, L. Alcácer & A. B. Henriques - 2019 - Logic Journal of the IGPL 27 (3):328-370.details
|
|
Decision and optimization problems in the unreliable-circuit logic.J. Rasga, C. Sernadas, P. Mateus & A. Sernadas - 2017 - Logic Journal of the IGPL 25 (3):283-308.details
|
|
Axiomatizing Changing Conceptions of the Geometric Continuum I: Euclid-Hilbert†.John T. Baldwin - 2018 - Philosophia Mathematica 26 (3):346-374.details
|
|
Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski. [REVIEW]Alfred Tarski & Hourya Sinaceur - 2000 - Bulletin of Symbolic Logic 6 (1):1-44.details
|
|
Tarski.Benedict Eastaugh - 2017 - In Alex Malpass & Marianna Antonutti Marfori (eds.), The History of Philosophical and Formal Logic: From Aristotle to Tarski. New York: Bloomsbury Publishing. pp. 293-313.details
|
|
On tarski’s assumptions.Jaakko Hintikka - 2005 - Synthese 142 (3):353-369.details
|
|
Interpretations With Parameters.L. W. Szczerba - 1980 - Mathematical Logic Quarterly 26 (1-6):35-39.details
|
|
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.details
|
|
Elementare ma complessa: la prospettiva della complessità computazionale attraverso il caso studio della geometria di Tarski.Pierluigi Graziani - 2012 - In Vincenzo Fano, Enrico Giannetto, Giulia Giannini & Pierluigi Graziani (eds.), Complessità e Riduzionismo. ISONOMIA - Epistemologica Series Editor. pp. 66-81.details
|
|
A modal logic framework for reasoning about comparative distances and topology.Mikhail Sheremet, Frank Wolter & Michael Zakharyaschev - 2010 - Annals of Pure and Applied Logic 161 (4):534-559.details
|
|
Jak pojmenovat reálné číslo?Vojtěch Kolman - 2011 - Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 18 (3):283-301.details
|
|
The Elementary Theory of Interval Real Numbers.Stephen D. Comer - 1985 - Mathematical Logic Quarterly 31 (1‐6):89-95.details
|
|
Twin Paradox and the Logical Foundation of Relativity Theory.Judit X. Madarász, István Németi & Gergely Székely - 2006 - Foundations of Physics 36 (5):681-714.details
|
|
Quantifier elimination for elementary geometry and elementary affine geometry.Rafael Grimson, Bart Kuijpers & Walied Othman - 2012 - Mathematical Logic Quarterly 58 (6):399-416.details
|
|
Limit computable integer parts.Paola D’Aquino, Julia Knight & Karen Lange - 2011 - Archive for Mathematical Logic 50 (7-8):681-695.details
|
|
Topological Elementary Equivalence of Closed Semi-Algebraic Sets in the Real Plane.Bart Kuijpers, Jan Paredaens & Jan Van Den Bussche - 2000 - Journal of Symbolic Logic 65 (4):1530 - 1555.details
|
|
Model theory of analytic functions: some historical comments.Deirdre Haskell - 2012 - Bulletin of Symbolic Logic 18 (3):368-381.details
|
|
Logic and philosophy of mathematics in the early Husserl.Stefania Centrone - 2010 - New York: Springer.details
|
|
On the decidability of the real field with a generic power function.Gareth Jones & Tamara Servi - 2011 - Journal of Symbolic Logic 76 (4):1418-1428.details
|
|
Against the Judgment-Dependence of Mathematics and Logic.Alexander Paseau - 2012 - Erkenntnis 76 (1):23-40.details
|
|
About and Around Computing Over the Reals.Solomon Feferman - unknowndetails
|
|
Tarski’s Influence on Computer Science.Solomon Feferman - 2018 - In Urszula Wybraniec-Skardowska & Ángel Garrido (eds.), The Lvov-Warsaw School. Past and Present. Cham, Switzerland: Springer- Birkhauser,. pp. 391-404.details
|
|
Von Neumann, Gödel and complexity theory.Alasdair Urquhart - 2010 - Bulletin of Symbolic Logic 16 (4):516-530.details
|
|
On the equational theory of projection lattices of finite von Neumann factors.Christian Herrmann - 2010 - Journal of Symbolic Logic 75 (3):1102-1110.details
|
|
Quantum Logic as Motivated by Quantum Computing.J. Michael Dunn, Tobias J. Hagge, Lawrence S. Moss & Zhenghan Wang - 2005 - Journal of Symbolic Logic 70 (2):353 - 359.details
|
|
Completeness and Categoricity: 19th Century Axiomatics to 21st Century Senatics.Steve Awodey & Erich H. Reck - 2002 - History and Philosophy of Logic 23 (1):1-30.details
|
|
Continuum, name and paradox.Vojtěch Kolman - 2010 - Synthese 175 (3):351 - 367.details
|
|
logicism, intuitionism, and formalism - What has become of them?Sten Lindstr©œm, Erik Palmgren, Krister Segerberg & Viggo Stoltenberg-Hansen (eds.) - 2008 - Berlin, Germany: Springer.details
|
|
The development of mathematical logic from Russell to Tarski, 1900-1935.Paolo Mancosu, Richard Zach & Calixto Badesa - 2011 - In Leila Haaparanta (ed.), The development of modern logic. New York: Oxford University Press.details
|
|
Some recent essays in the history of the philosophy of mathematics: A critical review. [REVIEW]William W. Tait - 1993 - Synthese 96 (2):293 - 331.details
|
|
Classifying the computational complexity of problems.Larry Stockmeyer - 1987 - Journal of Symbolic Logic 52 (1):1-43.details
|
|
On direct products of theories.Andrzej Mostowski - 1952 - Journal of Symbolic Logic 17 (1):1-31.details
|
|
Quantifier elimination for neocompact sets.H. Jerome Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.details
|
|
The mathematical development of set theory from Cantor to Cohen.Akihiro Kanamori - 1996 - Bulletin of Symbolic Logic 2 (1):1-71.details
|
|
On tarski’s assumptions.Jaakko Hintikka - 2005 - Synthese 142 (3):353 - 369.details
|
|
A decision procedure for probability calculus with applications.Branden Fitelson - 2008 - Review of Symbolic Logic 1 (1):111-125.details
|
|
Whither relevant arithmetic?Harvey Friedman & Robert K. Meyer - 1992 - Journal of Symbolic Logic 57 (3):824-831.details
|
|
One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.details
|
|
Interpretability in Robinson's Q.Fernando Ferreira & Gilda Ferreira - 2013 - Bulletin of Symbolic Logic 19 (3):289-317.details
|
|
Computability of String Functions Over Algebraic Structures Armin Hemmerling.Armin Hemmerling - 1998 - Mathematical Logic Quarterly 44 (1):1-44.details
|
|
Lógica e Completude.Arno A. Viero - 2001 - Princípios 8 (10):07-24.details
|
|
From completeness to archimedean completenes.Philip Ehrlich - 1997 - Synthese 110 (1):57-76.details
|
|
Is there a nonrecursive decidable equational theory?Benjamin Wells - 2002 - Minds and Machines 12 (2):301-324.details
|
|
Topological elementary equivalence of closed semi-algebraic sets in the real plane.Bart Kuijpers, Jan Paredaens & Jan Van den Bussche - 2000 - Journal of Symbolic Logic 65 (4):1530-1555.details
|
|
On the concept of categoricity.Andrzej Grzegorczyk - 1962 - Studia Logica 13 (1):39 - 66.details
|
|
Groundwork for weak analysis.António M. Fernandes & Fernando Ferreira - 2002 - Journal of Symbolic Logic 67 (2):557-578.details
|
|
Probing the quantitative–qualitative divide in probabilistic reasoning.Duligur Ibeling, Thomas Icard, Krzysztof Mierzewski & Milan Mossé - 2024 - Annals of Pure and Applied Logic 175 (9):103339.details
|
|