- 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
|
|
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
|
|
On BI‐Immune Isols.Joachim Biskup - 1977 - Mathematical Logic Quarterly 23 (31-35):469-484.details
|
|
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
|
|
Recursively Enumerable L‐Sets.Loredana Biacino & Giangiacomo Gerla - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):107-113.details
|
|
Reducibility in some categories of partial recursive operators.Caterina Bianchini & Andrea Sorbi - 1992 - Mathematical Logic Quarterly 38 (1):349-359.details
|
|
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
|
|
Decidability, Recursive Enumerability and Kleene Hierarchy For L‐Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Mathematical Logic Quarterly 35 (1):49-62.details
|
|
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
|
|
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
|
|
Towards a Coherent Theory of Physics and Mathematics: The Theory–Experiment Connection.Paul Benioff - 2005 - Foundations of Physics 35 (11):1825-1856.details
|
|
Bounded query classes and the difference hierarchy.Richard Beigel, William I. Gasarch & Louise Hay - 1989 - Archive for Mathematical Logic 29 (2):69-84.details
|
|
From index sets to randomness in ∅ n : random reals and possibly infinite computations. Part II.Verónica Becher & Serge Grigorieff - 2009 - Journal of Symbolic Logic 74 (1):124-156.details
|
|
Rekursive Algebren mit Kettenbedingungen.Walter Baur - 1974 - Mathematical Logic Quarterly 20 (1‐3):37-46.details
|
|
Rekursive Algebren mit Kettenbedingungen.Walter Baur - 1974 - Mathematical Logic Quarterly 20 (1-3):37-46.details
|
|
On Some Properties of Recursively Enumerable Equivalence Relations.Stefano Baratella - 1989 - Mathematical Logic Quarterly 35 (3):261-268.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
|
|
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
|
|
Friedberg numberings in the Ershov hierarchy.Serikzhan A. Badaev, Mustafa Manat & Andrea Sorbi - 2015 - Archive for Mathematical Logic 54 (1-2):59-73.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
|
|
Many levels: More than one is algorithmic.Michael A. Arbib - 1987 - Behavioral and Brain Sciences 10 (3):478-479.details
|
|
What's in a function?Gian Aldo Antonelli - 1996 - Synthese 107 (2):167 - 204.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
|
|
Some notes on Church's thesis and the theory of games.Luca Anderlini - 1990 - Theory and Decision 29 (1):19-52.details
|
|
Methodologies for studying human knowledge.John R. Anderson - 1987 - Behavioral and Brain Sciences 10 (3):467-477.details
|
|
Incomplete Contracts and Complexity Costs.Luca Anderlini & Leonardo Felli - 1999 - Theory and Decision 46 (1):23-50.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
|
|
Representations without rules, connectionism and the syntactic argument.Kenneth Aizawa - 1994 - Synthese 101 (3):465-92.details
|
|
Some Special Pairs of Σ2 e-Degrees.Seema Ahmad & Alistair H. Lachlan - 1998 - Mathematical Logic Quarterly 44 (4):431-449.details
|
|
Turing’s Responses to Two Objections.Darren Abramson - 2008 - Minds and Machines 18 (2):147-167.details
|
|
The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.details
|
|