- Uniform inseparability in explicit mathematics.Andrea Cantini & Pierluigi Minari - 1999 - Journal of Symbolic Logic 64 (1):313-326.details
|
|
On the relation between choice and comprehension principles in second order arithmetic.Andrea Cantini - 1986 - Journal of Symbolic Logic 51 (2):360-373.details
|
|
On primitive recursive permutations and their inverses.Frank B. Cannonito & Mark Finkelstein - 1969 - Journal of Symbolic Logic 34 (4):634-638.details
|
|
A theory of formal truth arithmetically equivalent to ID.Andrea Cantini - 1990 - Journal of Symbolic Logic 55 (1):244 - 259.details
|
|
Topological Size of Sets of Partial Recursive Functions.Cristian Calude - 1982 - Mathematical Logic Quarterly 28 (27‐32):455-462.details
|
|
Computable trees of Scott rank ω 1CK, and computable approximation.Wesley Calvert, Julia F. Knight & Jessica Millar - 2006 - Journal of Symbolic Logic 71 (1):283-298.details
|
|
Classification from a computable viewpoint.Wesley Calvert & Julia F. Knight - 2006 - Bulletin of Symbolic Logic 12 (2):191-218.details
|
|
On the weak Kleene scheme in Kripke's theory of truth.James Cain & Zlatan Damnjanovic - 1991 - Journal of Symbolic Logic 56 (4):1452-1468.details
|
|
Recursion theory and the lambda-calculus.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):67-83.details
|
|
Definability of Recursively Enumerable Sets in Abstract Computational Complexity Theory.Robert E. Byerly - 1984 - Mathematical Logic Quarterly 30 (32-34):499-503.details
|
|
An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.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 - 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
|
|
About Segment Complexity of Turing Reductions.Valeriy K. Bulitko - 1999 - Mathematical Logic Quarterly 45 (4):561-571.details
|
|
Definability in the monadic second-order theory of successor.J. Richard Buchi & Lawrence H. Landweber - 1969 - Journal of Symbolic Logic 34 (2):166 - 170.details
|
|
On the complexity of classifying lebesgue spaces.Tyler A. Brown, Timothy H. Mcnicholl & Alexander G. Melnikov - 2020 - Journal of Symbolic Logic 85 (3):1254-1288.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
|
|
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
|
|
AI and the Turing model of computation.Thomas M. Breuel - 1990 - Behavioral and Brain Sciences 13 (4):657-657.details
|
|
Weihrauch degrees, omniscience principles and weak computability.Vasco Brattka & Guido Gherardi - 2011 - Journal of Symbolic Logic 76 (1):143 - 176.details
|
|
The Discontinuity Problem.Vasco Brattka - 2023 - Journal of Symbolic Logic 88 (3):1191-1212.details
|
|
Effective choice and boundedness principles in computable analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.details
|
|
Determinism, laws, and predictability in principle.Richard Boyd - 1972 - Philosophy of Science 39 (4):431-450.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 complexity properties of recursively enumerable sets.M. Blum & I. Marques - 1973 - Journal of Symbolic Logic 38 (4):579-593.details
|
|
Some Remarks on Uniform Halting Problems.Stephen L. Bloom - 1971 - Mathematical Logic Quarterly 17 (1):281-284.details
|
|
Some Remarks on Uniform Halting Problems.Stephen L. Bloom - 1971 - Mathematical Logic Quarterly 17 (1):281-284.details
|
|
Proving church's thesis.Robert Black - 2000 - Philosophia Mathematica 8 (3):244--58.details
|
|
Marginalia on a theorem of Woodin.Rasmus Blanck & Ali Enayat - 2017 - Journal of Symbolic Logic 82 (1):359-374.details
|
|
Hierarchical Incompleteness Results for Arithmetically Definable Extensions of Fragments of Arithmetic.Rasmus Blanck - 2021 - Review of Symbolic Logic 14 (3):624-644.details
|
|
Cores of Π11 sets of reals.Andreas Blass & Douglas Cenzer - 1974 - Journal of Symbolic Logic 39 (4):649 - 654.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
|
|
Embeddings into the Medvedev and Muchnik lattices of Π0 1 classes.Stephen Binns & Stephen G. Simpson - 2004 - Archive for Mathematical Logic 43 (3):399-414.details
|
|
Completeness, Compactness, Effective Dimensions.Stephen Binns - 2013 - Mathematical Logic Quarterly 59 (3):206-218.details
|
|
A splitting theorem for the Medvedev and Muchnik lattices.Stephen Binns - 2003 - Mathematical Logic Quarterly 49 (4):327.details
|
|
Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.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 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):349-359.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
|
|
The distribution of properly Σ20 e-degrees.Stanislaw Bereznyuk, Richard Coles & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):19-32.details
|
|
On the relation provable equivalence and on partitions in effectively inseparable sets.Claudio Bernardi - 1981 - Studia Logica 40 (1):29 - 37.details
|
|
Effective Transformations on Probabilistic Data.Jan Bergstra - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (13-18):219-226.details
|
|
Recursively enumerable complexity sequences and measure independence.Victor L. Bennison - 1980 - Journal of Symbolic Logic 45 (3):417-438.details
|
|
The complexity of ODDnA.Richard Beigel, William Gasarch, Martin Kummer, Georgia Martin, Timothy Mcnicholl & Frank Stephan - 2000 - Journal of Symbolic Logic 65 (1):1-18.details
|
|