- Buttresses of the Turing Barrier.Paolo Cotogno - 2015 - Acta Analytica 30 (3):275-282.details
|
|
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.details
|
|
Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Mathematical Logic Quarterly 34 (6):491-522.details
|
|
On Lachlan’s major sub-degree problem.S. Barry Cooper & Angsheng Li - 2008 - Archive for Mathematical Logic 47 (4):341-434.details
|
|
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Mathematical Logic Quarterly 33 (6):537-560.details
|
|
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):537-560.details
|
|
Cupping and noncupping in the enumeration degrees of ∑20 sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.details
|
|
The algorithm/implementation distinction.Austen Clark - 1987 - Behavioral and Brain Sciences 10 (3):480-480.details
|
|
Functional principles and situated problem solving.William J. Clancey - 1987 - Behavioral and Brain Sciences 10 (3):479-480.details
|
|
Immunity properties and strong positive reducibilities.Irakli O. Chitaia, Roland Sh Omanadze & Andrea Sorbi - 2011 - Archive for Mathematical Logic 50 (3-4):341-352.details
|
|
Incomparability in local structures of s -degrees and Q -degrees.Irakli Chitaia, Keng Meng Ng, Andrea Sorbi & Yue Yang - 2020 - Archive for Mathematical Logic 59 (7-8):777-791.details
|
|
Degree structures of conjunctive reducibility.Irakli Chitaia & Roland Omanadze - 2021 - Archive for Mathematical Logic 61 (1):19-31.details
|
|
Reconciling simplicity and likelihood principles in perceptual organization.Nick Chater - 1996 - Psychological Review 103 (3):566-581.details
|
|
Computing the thinkable.David J. Chalmers - 1990 - Behavioral and Brain Sciences 13 (4):658-659.details
|
|
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.details
|
|
Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders.John Case - 1976 - Mathematical Logic Quarterly 22 (1):1-18.details
|
|
Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders.John Case - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):1-18.details
|
|
Rice and Rice-Shapiro Theorems for transfinite correction grammars.John Case & Sanjay Jain - 2011 - Mathematical Logic Quarterly 57 (5):504-516.details
|
|
Nondeterministic Ω‐Computations and the Analytical Hierarchy.J. Castro & F. Cucker - 1989 - Mathematical Logic Quarterly 35 (4):333-342.details
|
|
Nondeterministic Ω-Computations and the Analytical Hierarchy.J. Castro & F. Cucker - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (4):333-342.details
|
|
Maximal Arithmetical Reducibilities.John Case - 1974 - Mathematical Logic Quarterly 20 (13‐18):261-270.details
|
|
Maximal Arithmetical Reducibilities.John Case - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (13-18):261-270.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
|
|
Effectivizing Inseparability.John Case - 1991 - Mathematical Logic Quarterly 37 (7):97-111.details
|
|
Effectivizing Inseparability.John Case - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (7):97-111.details
|
|
On the Necessity of U-Shaped Learning.Lorenzo Carlucci & John Case - 2013 - Topics in Cognitive Science 5 (1):56-88.details
|
|
Continuity in Semantic Theories of Programming.Felice Cardone - 2015 - History and Philosophy of Logic 36 (3):242-261.details
|
|
Two Impredicative Theories of Properties and Sets.Andrea Cantini - 1988 - Mathematical Logic Quarterly 34 (5):403-420.details
|
|
Two Impredicative Theories of Properties and Sets.Andrea Cantini - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (5):403-420.details
|
|
Topological Size of Sets of Partial Recursive Functions.Cristian Calude - 1982 - Mathematical Logic Quarterly 28 (27‐32):455-462.details
|
|
Paulo Freire, Mathematics and Policies that Shape Mathematics.Isabel Cafezeiro, Ricardo Kubrusly, Ivan da Costa Marques & Edwaldo Cafezeiro - 2017 - Journal of the Indian Council of Philosophical Research 34 (2):227-246.details
|
|
Definability of recursively enumerable sets in abstract computational complexity theory.Robert E. Byerly - 1984 - Mathematical Logic Quarterly 30 (32‐34):499-503.details
|
|
Definability of Recursively Enumerable Sets in Abstract Computational Complexity Theory.Robert E. Byerly - 1984 - Mathematical Logic Quarterly 30 (32-34):499-503.details
|
|
Lucas revived? An undefended flank.Jeremy Butterfield - 1990 - Behavioral and Brain Sciences 13 (4):658-658.details
|
|
On the Number of Solovay r‐Degrees.Douglas R. Busch - 1976 - Mathematical Logic Quarterly 22 (1):283-286.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
|
|
Logical Complexity of Some Classes of Tree Languages Generated by Multiple‐Tree‐Automata.Wojciech Buszkowski - 1980 - Mathematical Logic Quarterly 26 (1‐6):41-49.details
|
|
Logical Complexity of Some Classes of Tree Languages Generated by Multiple‐Tree‐Automata.Wojciech Buszkowski - 1980 - Mathematical Logic Quarterly 26 (1-6):41-49.details
|
|
About Segment Complexity of Turing Reductions.Valeriy K. Bulitko - 1999 - Mathematical Logic Quarterly 45 (4):561-571.details
|
|
Effectively closed sets and enumerations.Paul Brodhead & Douglas Cenzer - 2008 - Archive for Mathematical Logic 46 (7-8):565-582.details
|
|
Cognition is not computation: The argument from irreversibility.Selmer Bringsjord - 1997 - Synthese 113 (2):285-320.details
|
|
Computation, among other things, is beneath us.Selmer Bringsjord - 1994 - Minds and Machines 4 (4):469-88.details
|
|
The R. E. Complexity of Decision Problems for Commutative Semi-Thue Systems With Recursive Rule Set.Egon Börger & Hans Kleine Büning - 1980 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (28-30):459-469.details
|
|
A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems.Egon Börger - 1979 - Mathematical Logic Quarterly 25 (7‐12):135-162.details
|
|
A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems.Egon Börger - 1979 - Mathematical Logic Quarterly 25 (7-12):135-162.details
|
|
AI and the Turing model of computation.Thomas M. Breuel - 1990 - Behavioral and Brain Sciences 13 (4):657-657.details
|
|
The dependence of computability on numerical notations.Ethan Brauer - 2021 - Synthese 198 (11):10485-10511.details
|
|
Algorithms and physical laws.Franklin Boyle - 1990 - Behavioral and Brain Sciences 13 (4):656-657.details
|
|
On “seeing” the truth of the Gödel sentence.George Boolos - 1990 - Behavioral and Brain Sciences 13 (4):655-656.details
|
|
On BI‐Immune Isols.Joachim Biskup - 1976 - Mathematical Logic Quarterly 23 (31‐35):469-484.details
|
|