- Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.details
|
|
Is the human mind a Turing machine?D. King - 1996 - Synthese 108 (3):379-89.details
|
|
Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations.Filippos A. Papagiannopoulos - 2018 - Dissertation, University of Western Ontariodetails
|
|
(1 other version)The Significance of Evidence-based Reasoning for Mathematics, Mathematics Education, Philosophy and the Natural Sciences.Bhupinder Singh Anand - forthcomingdetails
|
|
The Abstraction/Representation Account of Computation and Subjective Experience.Jochen Szangolies - 2020 - Minds and Machines 30 (2):259-299.details
|
|
(1 other version)Computers Are Syntax All the Way Down: Reply to Bozşahin.William J. Rapaport - 2019 - Minds and Machines 29 (2):227-237.details
|
|
Statements and open problems on decidable sets X⊆N that contain informal notions and refer to the current knowledge on X.Apoloniusz Tyszka - 2022 - Journal of Applied Computer Science and Mathematics 16 (2):31-35.details
|
|
Johan van Benthem on Logic and Information Dynamics.Alexandru Baltag & Sonja Smets (eds.) - 2014 - Cham, Switzerland: Springer International Publishing.details
|
|
A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Cham, Switzerland: Springer International Publishing. pp. 289-337.details
|
|
Informal versus formal mathematics.Francisco Antonio Doria - 2007 - Synthese 154 (3):401-415.details
|
|
TuringL-machines and recursive computability forL-maps.Giangiacomo Gerla - 1989 - Studia Logica 48 (2):179-192.details
|
|
On Modal Logics of Partial Recursive Functions.Pavel Naumov - 2005 - Studia Logica 81 (3):295-309.details
|
|
(1 other version)Almost Recursivity and Partial Degrees.Vladeta Vuckovic - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (25-27):419-426.details
|
|
(1 other version)Classes of Recursive Functions and Their Index Sets.F. D. Lewis - 1971 - Mathematical Logic Quarterly 17 (1):291-294.details
|
|
(2 other versions)Some Notions of Reducibility and Productiveness.A. H. Lachlan - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (1):17-44.details
|
|
(1 other version)Über Halbordnungen von WT-Graden in e-Graden.Freidrich Hebeisen - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (13-18):209-212.details
|
|
(1 other version)Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (1):49-62.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
|
|
Axiomatizing semantic theories of truth?Martin Fischer, Volker Halbach, Jönne Kriener & Johannes Stern - 2015 - Review of Symbolic Logic 8 (2):257-278.details
|
|
Representation and Invariance of Scientific Structures.Patrick Suppes - 2002 - CSLI Publications (distributed by Chicago University Press).details
|
|
Naive Probability: Model‐Based Estimates of Unique Events.Sangeet S. Khemlani, Max Lotstein & Philip N. Johnson-Laird - 2015 - Cognitive Science 39 (6):1216-1258.details
|
|
Betting your life on an algorithm.Daniel C. Dennett - 1990 - Behavioral and Brain Sciences 13 (4):660-661.details
|
|
(1 other version)A degree-theoretic definition of the ramified analytical hierarchy.Carl G. Jockusch & Stephen G. Simpson - 1976 - Annals of Mathematical Logic 10 (1):1-32.details
|
|
Jump Theorems for REA Operators.Alistair H. Lachlan & Xiaoding Yi - 1993 - Mathematical Logic Quarterly 39 (1):1-6.details
|
|
(1 other version)On the Topological Size of Sets of Random Strings.M. Zimand - 1986 - Mathematical Logic Quarterly 32 (6):81-88.details
|
|
(1 other version)Embedding Properties of Total Recursive Functions.W. Maier, W. Menzel & V. Sperschneider - 1982 - Mathematical Logic Quarterly 28 (33‐38):565-574.details
|
|
(1 other version)On the nonboundability of total effective operators.Thomas Zeugmann - 1984 - Mathematical Logic Quarterly 30 (9‐11):169-172.details
|
|
(2 other versions)Masstheoretische Ergebnisse für WT‐Grade.Friedrich Hebeisen - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (3‐6):33-36.details
|
|
(1 other version)Almost Recursivity and Partial Degrees.Vladeta Vuckovic - 1974 - Mathematical Logic Quarterly 20 (25‐27):419-426.details
|
|
(1 other version)Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20‐22):341-352.details
|
|
Continuous versus Borel reductions.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):761-770.details
|
|
Limit lemmas and jump inversion in the enumeration degrees.Evan J. Griffiths - 2003 - Archive for Mathematical Logic 42 (6):553-562.details
|
|
Then-rea enumeration degrees are dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.details
|
|
(1 other version)Decidability, Recursive Enumerability and Kleene Hierarchy For L‐Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Mathematical Logic Quarterly 35 (1):49-62.details
|
|
On the difficulty of making social choices.Hannu Nurmi - 1995 - Theory and Decision 38 (1):99-119.details
|
|
The complexity of learning SUBSEQ(A).Stephen Fenner, William Gasarch & Brian Postow - 2009 - Journal of Symbolic Logic 74 (3):939-975.details
|
|
PDL with intersection and converse: satisfiability and infinite-state model checking.Stefan Göller, Markus Lohrey & Carsten Lutz - 2009 - Journal of Symbolic Logic 74 (1):279-314.details
|
|
Herbrand semantics, the potential infinite, and ontology-free logic.Theodore Hailperin - 1992 - History and Philosophy of Logic 13 (1):69-90.details
|
|
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.details
|
|
The logic of unboundedly reactive systems.William W. Rozeboom - 1978 - Synthese 39 (3):435 - 530.details
|
|
Algorithmic information theory and undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.details
|
|
Understanding church's thesis.Stewart Shapiro - 1981 - Journal of Philosophical Logic 10 (3):353--65.details
|
|
On interpreting Chaitin's incompleteness theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.details
|
|
Decidable and undecidable logics with a binary modality.ágnes Kurucz, István Németi, Ildikó Sain & András Simon - 1995 - Journal of Logic, Language and Information 4 (3):191-206.details
|
|
Fuzzy logic and arithmetical hierarchy, II.Petr Hájek - 1997 - Studia Logica 58 (1):129-141.details
|
|
The Gödel Incompleteness Theorems (1931) by the Axiom of Choice.Vasil Penchev - 2020 - Econometrics: Mathematical Methods and Programming eJournal (Elsevier: SSRN) 13 (39):1-4.details
|
|
Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations.Philippos Papayannopoulos - 2018 - Dissertation, details
|
|
Computational Complexity Theory and the Philosophy of Mathematics†.Walter Dean - 2019 - Philosophia Mathematica 27 (3):381-439.details
|
|
(1 other version)Universality of functional systems and totality of their elements – the limits of conflict and mutual influence.Jerzy Mycka - 2017 - Philosophical Problems in Science 63:31-58.details
|
|
Some Reflections on the Foundations of Ordinary Recursion Theory and a New Proposal.George Tourlakis - 1986 - Mathematical Logic Quarterly 32 (31-34):503-515.details
|
|