- Myhill's work in recursion theory.J. C. E. Dekker & E. Ellentuck - 1992 - Annals of Pure and Applied Logic 56 (1-3):43-71.details
|
|
Complete, Recursively Enumerable Relations in Arithmetic.Giovanna D'Agostino & Mario Magnago - 1995 - Mathematical Logic Quarterly 41 (1):65-72.details
|
|
Polynomial clone reducibility.Quinn Culver - 2014 - Archive for Mathematical Logic 53 (1-2):1-10.details
|
|
Degree spectra of the successor relation of computable linear orderings.Jennifer Chubb, Andrey Frolov & Valentina Harizanov - 2009 - Archive for Mathematical Logic 48 (1):7-13.details
|
|
The strength of the Grätzer-Schmidt theorem.Katie Brodhead, Mushfeq Khan, Bjørn Kjos-Hanssen, William A. Lampe, Paul Kim Long V. Nguyen & Richard A. Shore - 2016 - Archive for Mathematical Logic 55 (5-6):687-704.details
|
|
Weihrauch degrees, omniscience principles and weak computability.Vasco Brattka & Guido Gherardi - 2011 - Journal of Symbolic Logic 76 (1):143 - 176.details
|
|
Effective choice and boundedness principles in computable analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.details
|
|
Proving church's thesis.Robert Black - 2000 - Philosophia Mathematica 8 (3):244--58.details
|
|
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.details
|
|
Hypersimplicity and semicomputability in the weak truth table degrees.George Barmpalias - 2005 - Archive for Mathematical Logic 44 (8):1045-1065.details
|
|
Π 1 0 classes, L R degrees and Turing degrees.George Barmpalias, Andrew E. M. Lewis & Frank Stephan - 2008 - Annals of Pure and Applied Logic 156 (1):21-38.details
|
|
Approximation Representations for Δ2 Reals.George Barmpalias - 2004 - Archive for Mathematical Logic 43 (8):947-964.details
|
|
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent.Klaus Ambos-Spies, Philipp Bodewig, Yun Fan & Thorsten Kräling - 2013 - Annals of Pure and Applied Logic 164 (5):577-588.details
|
|
Shadows of Syntax: Revitalizing Logical and Mathematical Conventionalism.Jared Warren - 2020 - New York, USA: Oxford University Press.details
|
|
Effective Nonrecursiveness.Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (1):45-48.details
|
|
Diagonalization in double frames.Andrzej Wiśniewski & Jerzy Pogonowski - 2010 - Logica Universalis 4 (1):31-39.details
|
|
Infinite Reasoning.Jared Warren - 2020 - Philosophy and Phenomenological Research 103 (2):385-407.details
|
|
A Metasemantic Challenge for Mathematical Determinacy.Jared Warren & Daniel Waxman - 2020 - Synthese 197 (2):477-495.details
|
|
A semantical proof of De Jongh's theorem.Jaap van Oosten - 1991 - Archive for Mathematical Logic 31 (2):105-114.details
|
|
Herbrand semantics, the potential infinite, and ontology-free logic.Theodore Hailperin - 1992 - History and Philosophy of Logic 13 (1):69-90.details
|
|
Arithmetical Measure.Sebastiaan A. Terwijn & Leen Torenvliet - 1998 - Mathematical Logic Quarterly 44 (2):277-286.details
|
|
Relativizing Relativity.K. Svozil - 2000 - Foundations of Physics 30 (7):1001-1016.details
|
|
Learning via queries and oracles.Frank Stephan - 1998 - Annals of Pure and Applied Logic 94 (1-3):273-296.details
|
|
An incomplete set of shortest descriptions.Frank Stephan & Jason Teutsch - 2012 - Journal of Symbolic Logic 77 (1):291-307.details
|
|
Some Hierarchies of Primitive Recursive Functions on Term Algebras.Klaus-Hilmar Sprenger - 1997 - Mathematical Logic Quarterly 43 (2):251-286.details
|
|
Intermediate logics and factors of the Medvedev lattice.Andrea Sorbi & Sebastiaan A. Terwijn - 2008 - Annals of Pure and Applied Logic 155 (2):69-85.details
|
|
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability.Richard A. Shore - 1997 - Archive for Mathematical Logic 36 (4-5):233-253.details
|
|
A guided tour of minimal indices and shortest descriptions.Marcus Schaefer - 1998 - Archive for Mathematical Logic 37 (8):521-548.details
|
|
Remarks on the Gödelian Anti-Mechanist Arguments.Panu Raatikainen - 2020 - Studia Semiotyczne 34 (1):267–278.details
|
|
On interpreting Chaitin's incompleteness theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.details
|
|
Algorithmic information theory and undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.details
|
|
The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.details
|
|
Jean-Pierre Dupuy, the mechanization of mind: On the origins of cognitive science. [REVIEW]Gualtiero Piccinini - 2002 - Minds and Machines 12 (3):448-453.details
|
|
Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.details
|
|
Degrees bounding principles and universal instances in reverse mathematics.Ludovic Patey - 2015 - Annals of Pure and Applied Logic 166 (11):1165-1185.details
|
|
The diagonal method and hypercomputation.Toby Ord & Tien D. Kieu - 2005 - British Journal for the Philosophy of Science 56 (1):147-156.details
|
|
Some structural properties of quasi-degrees.Roland Sh Omanadze - 2018 - Logic Journal of the IGPL 26 (1):191-201.details
|
|
Is Church’s Thesis Still Relevant?Jerzy Mycka & Adam Olszewski - 2020 - Studies in Logic, Grammar and Rhetoric 63 (1):31-51.details
|
|
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.details
|
|
Kolmogorov–Loveland randomness and stochasticity.Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann & Frank Stephan - 2006 - Annals of Pure and Applied Logic 138 (1):183-210.details
|
|
Exact Pairs for Abstract Bounded Reducibilities.Wolfgang Merkle - 1999 - Mathematical Logic Quarterly 45 (3):343-360.details
|
|
Computability in structures representing a Scott set.Alex M. McAllister - 2001 - Archive for Mathematical Logic 40 (3):147-165.details
|
|
Alonzo church:his life, his work and some of his miracles.Maía Manzano - 1997 - History and Philosophy of Logic 18 (4):211-232.details
|
|
Equational theories for inductive types.Ralph Loader - 1997 - Annals of Pure and Applied Logic 84 (2):175-217.details
|
|
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.details
|
|
Natural factors of the Muchnik lattice capturing IPC.Rutger Kuyper - 2013 - Annals of Pure and Applied Logic 164 (10):1025-1036.details
|
|
Natural factors of the Medvedev lattice capturing IPC.Rutger Kuyper - 2014 - Archive for Mathematical Logic 53 (7-8):865-879.details
|
|
First-Order Logic in the Medvedev Lattice.Rutger Kuyper - 2015 - Studia Logica 103 (6):1185-1224.details
|
|
The isomorphism problem for ω-automatic trees.Dietrich Kuske, Jiamou Liu & Markus Lohrey - 2013 - Annals of Pure and Applied Logic 164 (1):30-48.details
|
|
Effective Search Problems.Martin Kummer & Frank Stephan - 1994 - Mathematical Logic Quarterly 40 (2):224-236.details
|
|