- 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
|
|
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.details
|
|
(1 other version)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
|
|
(1 other version)Nondeterministic Ω‐Computations and the Analytical Hierarchy.J. Castro & F. Cucker - 1989 - Mathematical Logic Quarterly 35 (4):333-342.details
|
|
(1 other version)Nondeterministic Ω-Computations and the Analytical Hierarchy.J. Castro & F. Cucker - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (4):333-342.details
|
|
(1 other version)Maximal Arithmetical Reducibilities.John Case - 1974 - Mathematical Logic Quarterly 20 (13‐18):261-270.details
|
|
(1 other version)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
|
|
(1 other version)Effectivizing Inseparability.John Case - 1991 - Mathematical Logic Quarterly 37 (7):97-111.details
|
|
(1 other version)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
|
|
(1 other version)Two Impredicative Theories of Properties and Sets.Andrea Cantini - 1988 - Mathematical Logic Quarterly 34 (5):403-420.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
|
|
(1 other version)On the Number of Solovay r-Degrees.Douglas R. Busch - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):283-286.details
|
|
(1 other version)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
|
|
(1 other version)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
|
|
Effectively closed sets and enumerations.Paul Brodhead & Douglas Cenzer - 2008 - Archive for Mathematical Logic 46 (7-8):565-582.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
|
|
(1 other version)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
|
|
(1 other version)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
|
|
The dependence of computability on numerical notations.Ethan Brauer - 2021 - Synthese 198 (11):10485-10511.details
|
|
On “seeing” the truth of the Gödel sentence.George Boolos - 1990 - Behavioral and Brain Sciences 13 (4):655-656.details
|
|
(1 other version)On BI‐Immune Isols.Joachim Biskup - 1976 - Mathematical Logic Quarterly 23 (31‐35):469-484.details
|
|
(1 other version)Small Π0 1 Classes.Stephen Binns - 2005 - Archive for Mathematical Logic 45 (4):393-410.details
|
|
Completeness, Compactness, Effective Dimensions.Stephen Binns - 2013 - Mathematical Logic Quarterly 59 (3):206-218.details
|
|
(1 other version)Reducibility in some categories of partial recursive operators.Caterina Bianchini & Andrea Sorbi - 1992 - Mathematical Logic Quarterly 38 (1):349-359.details
|
|
(1 other version)Reducibility in some categories of partial recursive operators.Caterina Bianchini & Andrea Sorbi - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):349-359.details
|
|
(1 other version)Recursively Enumerable L‐Sets.Loredana Biacino & Giangiacomo Gerla - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):107-113.details
|
|
A Note on Closed Degrees of Difficulty of the Medvedev Lattice.Caterina Bianchini & Andrea Sorbi - 1996 - Mathematical Logic Quarterly 42 (1):127-133.details
|
|
Expressive power of digraph solvability.Marc Bezem, Clemens Grabmayer & Michał Walicki - 2012 - Annals of Pure and Applied Logic 163 (3):200-213.details
|
|
Translating the hypergame paradox: Remarks on the set of founded elements of a relation. [REVIEW]Claudio Bernardi & Giovanna D'Agostino - 1996 - Journal of Philosophical Logic 25 (5):545 - 557.details
|
|
On the relation provable equivalence and on partitions in effectively inseparable sets.Claudio Bernardi - 1981 - Studia Logica 40 (1):29 - 37.details
|
|
(1 other version)Rekursive Algebren mit Kettenbedingungen.Walter Baur - 1974 - Mathematical Logic Quarterly 20 (1-3):37-46.details
|
|
(1 other version)On Some Properties of Recursively Enumerable Equivalence Relations.Stefano Baratella - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (3):261-268.details
|
|
The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.details
|
|
Rogers semilattices of families of two embedded sets in the Ershov hierarchy.Serikzhan A. Badaev, Mustafa Manat & Andrea Sorbi - 2012 - Mathematical Logic Quarterly 58 (4-5):366-376.details
|
|
Sheaf toposes for realizability.Steven Awodey & Andrej Bauer - 2008 - Archive for Mathematical Logic 47 (5):465-478.details
|
|
Recursive Structures and Ershov's Hierarchy.Christopher J. Ash & Julia F. Knight - 1996 - Mathematical Logic Quarterly 42 (1):461-468.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
|
|
Methodologies for studying human knowledge.John R. Anderson - 1987 - Behavioral and Brain Sciences 10 (3):467-477.details
|
|
Implementations, algorithms, and more.John R. Anderson - 1987 - Behavioral and Brain Sciences 10 (3):498-505.details
|
|
A Bounded Jump for the Bounded Turing Degrees.Bernard Anderson & Barbara Csima - 2014 - Notre Dame Journal of Formal Logic 55 (2):245-264.details
|
|
Some Special Pairs of Σ2 e-Degrees.Seema Ahmad & Alistair H. Lachlan - 1998 - Mathematical Logic Quarterly 44 (4):431-449.details
|
|
Is Turing's Thesis the Consequence of a More General Physical Principle?Matthew P. Szudzik - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 714--722.details
|
|
Set theory influenced logic, both through its semantics, by expanding the possible models of various theories and by the formal definition of a model; and through its syntax, by allowing for logical languages in which formulas can be infinite in length or in which the number of symbols is uncountable.Truth Definitions - 1998 - Bulletin of Symbolic Logic 4 (3).details
|
|