- The Abstraction/Representation Account of Computation and Subjective Experience.Jochen Szangolies - 2020 - Minds and Machines 30 (2):259-299.details
|
|
Computational Complexity Theory and the Philosophy of Mathematics†.Walter Dean - 2019 - Philosophia Mathematica 27 (3):381-439.details
|
|
La historia y la gramática de la recursión: una precisión desde la obra de Wittgenstein.Sergio Mota - 2014 - Pensamiento y Cultura 17 (1):20-48.details
|
|
Enciclopédia de Termos Lógico-Filosóficos.João Miguel Biscaia Branquinho, Desidério Murcho & Nelson Gonçalves Gomes (eds.) - 2006 - São Paulo, SP, Brasil: Martins Fontes.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
|
|
Emil Post.Alasdair Urquhart - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 5--617.details
|
|
Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.details
|
|
Intermediate Logics and the de Jongh property.Dick de Jongh, Rineke Verbrugge & Albert Visser - 2011 - Archive for Mathematical Logic 50 (1-2):197-213.details
|
|
Turing machines.David Barker-Plummer - 2008 - Stanford Encyclopedia of Philosophy.details
|
|
(1 other version)Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.details
|
|
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.details
|
|
Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.details
|
|
On the person-based predictive policing of AI.Tzu-Wei Hung & Chun-Ping Yen - 2020 - Ethics and Information Technology 23 (3):165-176.details
|
|
Péter on Church's Thesis, Constructivity and Computers.Mate Szabo - 2021 - In Liesbeth De Mol, Andreas Weiermann, Florin Manea & David Fernández-Duque (eds.), Connecting with Computability. Proceedings of Computability in Europe. pp. 434-445.details
|
|
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.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
|
|
Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic.J. W. Addison - 2004 - Annals of Pure and Applied Logic 126 (1-3):77-92.details
|
|
On the notion of effectiveness.Stewart Shapiro - 1980 - History and Philosophy of Logic 1 (1-2):209-230.details
|
|
The mathematical work of S. C. Kleene.J. R. Shoenfield & S. C. Kleene - 1995 - Bulletin of Symbolic Logic 1 (1):8-43.details
|
|
Index sets related to prompt simplicity.Steven Schwarz - 1989 - Annals of Pure and Applied Logic 42 (3):243-254.details
|
|
Can Church’s thesis be viewed as a Carnapian explication?Paula Quinon - 2019 - Synthese 198 (Suppl 5):1047-1074.details
|
|
The Limits of Computation.Andrew Powell - 2022 - Axiomathes 32 (6):991-1011.details
|
|
(1 other version)A complete theory of natural, rational, and real numbers.John R. Myhill - 1950 - Journal of Symbolic Logic 15 (3):185-196.details
|
|
¿Qué es un algoritmo? Una respuesta desde la obra de Wittgenstein.Sergio Mota - 2015 - Endoxa 36:317.details
|
|
Thinking may be more than computing.Peter Kugel - 1986 - Cognition 22 (2):137-198.details
|
|
Levy and set theory.Akihiro Kanamori - 2006 - Annals of Pure and Applied Logic 140 (1):233-252.details
|
|
Effective topological spaces I: A definability theory.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (1):1-27.details
|
|
Effective topological spaces III: Forcing and definability.Iraj Kalantari & Galen Weitkamp - 1987 - Annals of Pure and Applied Logic 36:17-27.details
|
|
Effective topological spaces II: A hierarchy.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (2):207-224.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
|
|
Diagonalisation and Church's Thesis: Kleene's Homework.Enrique Alonso & Maria Manzano - 2005 - History and Philosophy of Logic 26 (2):93-113.details
|
|
Effective choice and boundedness principles in computable analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.details
|
|
Sobre el anti-realismo de Wittgenstein y su aplicación al programa chomskiano.Sergio Mota - 2014 - Metatheoria – Revista de Filosofía E Historia de la Ciencia 4:35--51.details
|
|