- Computers Are Syntax All the Way Down: Reply to Bozşahin.William J. Rapaport - 2019 - Minds and Machines 29 (2):227-237.details
|
|
Comparing the degrees of enumerability and the closed Medvedev degrees.Paul Shafer & Andrea Sorbi - 2019 - Archive for Mathematical Logic 58 (5-6):527-542.details
|
|
Hanf number for Scott sentences of computable structures.S. S. Goncharov, J. F. Knight & I. Souldatos - 2018 - Archive for Mathematical Logic 57 (7-8):889-907.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
|
|
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
|
|
Universal computably enumerable equivalence relations.Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro & Andrea Sorbi - 2014 - Journal of Symbolic Logic 79 (1):60-88.details
|
|
Agent‐based computational models and generative social science.Joshua M. Epstein - 1999 - Complexity 4 (5):41-60.details
|
|
On Modal Logics of Partial Recursive Functions.Pavel Naumov - 2005 - Studia Logica 81 (3):295-309.details
|
|
On the Number of Solovay r-Degrees.Douglas R. Busch - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):283-286.details
|
|
On Effectively Computable Operators.John P. Helm - 1971 - Mathematical Logic Quarterly 17 (1):231-244.details
|
|
Predictably computable functionals and definition by recursion.D. L. Kreider & R. W. Ritchie - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (5):65-80.details
|
|
Some remarks on ω-powers of enumerated sets and their applications to ω-operations.Andrzej Orlicki - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (2):149-161.details
|
|
Arithmetical Reducibilities I.Alan L. Selman - 1971 - Mathematical Logic Quarterly 17 (1):335-350.details
|
|
Complexity of equational theory of relational algebras with standard projection elements.Szabolcs Mikulás, Ildikó Sain & András Simon - 2015 - Synthese 192 (7):2159-2182.details
|
|
The Undecidability of Propositional Adaptive Logic.Leon Horsten & Philip Welch - 2007 - Synthese 158 (1):41-60.details
|
|
The Concept of n‐Cylinder and its Application.M. B. Thuraisingham - 1986 - Mathematical Logic Quarterly 32 (13-16):211-219.details
|
|
A Completeness Result for Fixed‐Point Algebras.Franco Montagna - 1984 - Mathematical Logic Quarterly 30 (32-34):525-532.details
|
|
On Some Properties of Recursively Enumerable Equivalence Relations.Stefano Baratella - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (3):261-268.details
|
|
Strong Reducibilities of Enumerations and Partial Enumerated Algebras.A. Orlicki - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (2):143-162.details
|
|
The First-Order Theory of thec-Degrees With the #-Operation.Patrick Farrington - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (33-38):487-493.details
|
|
Linear Order Types of Nonrecursive Presentability.Dev Kumar Roy - 1985 - Mathematical Logic Quarterly 31 (31-34):495-501.details
|
|
Relativized Cylindrification.Vladeta Vuckovic - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (8-12):167-172.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
|
|
The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.details
|
|
Representation and Invariance of Scientific Structures.Patrick Suppes - 2002 - CSLI Publications (distributed by Chicago University Press).details
|
|
Buttresses of the Turing Barrier.Paolo Cotogno - 2015 - Acta Analytica 30 (3):275-282.details
|
|
Thinking may be more than computing.Peter Kugel - 1986 - Cognition 22 (2):137-198.details
|
|
Where is the material of the emperor's mind?David L. Gilden & Joseph S. Lappin - 1990 - Behavioral and Brain Sciences 13 (4):665-666.details
|
|
Time-delays in conscious processes.Benjamin Libet - 1990 - Behavioral and Brain Sciences 13 (4):672-672.details
|
|
The powers of machines and minds.Chris Mortensen - 1990 - Behavioral and Brain Sciences 13 (4):678-679.details
|
|
Steadfast intentions.Keith K. Niall - 1990 - Behavioral and Brain Sciences 13 (4):679-680.details
|
|
The nonalgorithmic mind.Roger Penrose - 1990 - Behavioral and Brain Sciences 13 (4):692-705.details
|
|
Systematic, unconscious thought is the place to anchor quantum mechanics in the mind.Thomas Roeper - 1990 - Behavioral and Brain Sciences 13 (4):681-682.details
|
|
Seeing truth or just seeming true?Adina Roskies - 1990 - Behavioral and Brain Sciences 13 (4):682-683.details
|
|
The pretender's new clothes.Tim Smithers - 1990 - Behavioral and Brain Sciences 13 (4):683-684.details
|
|
And then a miracle happens….Keith E. Stanovich - 1990 - Behavioral and Brain Sciences 13 (4):684-685.details
|
|
Exactly which emperor is Penrose talking about?John K. Tsotsos - 1990 - Behavioral and Brain Sciences 13 (4):686-687.details
|
|
Penrose's grand unified mystery.David Waltz & James Pustejovsky - 1990 - Behavioral and Brain Sciences 13 (4):688-690.details
|
|
Minds beyond brains and algorithms.Jan M. Zytkow - 1990 - Behavioral and Brain Sciences 13 (4):691-692.details
|
|
Computing the thinkable.David J. Chalmers - 1990 - Behavioral and Brain Sciences 13 (4):658-659.details
|
|
Physics of brain-mind interaction.John C. Eccles - 1990 - Behavioral and Brain Sciences 13 (4):662-663.details
|
|
Is there more than one type of mental algorithm?Ronan G. Reilly - 1987 - Behavioral and Brain Sciences 10 (3):489-490.details
|
|
Applying Marr to memory.Keith Stenning - 1987 - Behavioral and Brain Sciences 10 (3):494-495.details
|
|
What is the algorithmic level?M. M. Taylor & R. A. Pigeau - 1987 - Behavioral and Brain Sciences 10 (3):495-496.details
|
|
Methodologies for studying human knowledge.John R. Anderson - 1987 - Behavioral and Brain Sciences 10 (3):467-477.details
|
|
Generality and applications.Jill H. Larkin - 1987 - Behavioral and Brain Sciences 10 (3):486-487.details
|
|
Generality’s price: Inescapable deficiencies in machine-learned programs.John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle & James S. Royer - 2006 - Annals of Pure and Applied Logic 139 (1):303-326.details
|
|
Rice and Rice-Shapiro Theorems for transfinite correction grammars.John Case & Sanjay Jain - 2011 - Mathematical Logic Quarterly 57 (5):504-516.details
|
|
Measure independent Gödel speed‐ups and the relative difficulty of recognizing sets.Martin K. Solomon - 1993 - Mathematical Logic Quarterly 39 (1):384-392.details
|
|
System function languages.M. B. Thuraisingham - 1993 - Mathematical Logic Quarterly 39 (1):357-366.details
|
|