- Effective Nonrecursiveness.Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (1):45-48.details
|
|
Algorithms and the Practical World.Paolo Totaro & Domenico Ninno - 2016 - Theory, Culture and Society 33 (1):139-152.details
|
|
Wittgenstein on the Infinity of Primes.Timm Lampert∗ - 2008 - History and Philosophy of Logic 29 (1):63-81.details
|
|
Mathematical realism and gödel's incompleteness theorems.Richard Tieszen - 1994 - Philosophia Mathematica 2 (3):177-201.details
|
|
Computational randomness and lowness.Sebastiaan A. Terwijn & Domenico Zambella - 2001 - Journal of Symbolic Logic 66 (3):1199-1205.details
|
|
Arithmetical Measure.Sebastiaan A. Terwijn & Leen Torenvliet - 1998 - Mathematical Logic Quarterly 44 (2):277-286.details
|
|
On the structures inside truth-table degrees.Frank Stephan - 2001 - Journal of Symbolic Logic 66 (2):731-770.details
|
|
Learning via queries and oracles.Frank Stephan - 1998 - Annals of Pure and Applied Logic 94 (1-3):273-296.details
|
|
Some Hierarchies of Primitive Recursive Functions on Term Algebras.Klaus-Hilmar Sprenger - 1997 - Mathematical Logic Quarterly 43 (2):251-286.details
|
|
Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.details
|
|
On explicating the concept the power of an arithmetical theory.Jörgen Sjögren - 2008 - Journal of Philosophical Logic 37 (2):183 - 202.details
|
|
The Ackermann functions are not optimal, but by how much?H. Simmons - 2010 - Journal of Symbolic Logic 75 (1):289-313.details
|
|
Mass problems and measure-theoretic regularity.Stephen G. Simpson - 2009 - Bulletin of Symbolic Logic 15 (4):385-409.details
|
|
Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.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
|
|
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 ∀∃ theory of peano σ1 sentences.Per Lindström & V. Yu Shavrukov - 2008 - Journal of Mathematical Logic 8 (2):251-280.details
|
|
The diagonal method and hypercomputation.Toby Ord & Tien D. Kieu - 2005 - British Journal for the Philosophy of Science 56 (1):147-156.details
|
|
Splittings of effectively speedable sets and effectively levelable sets.Roland S. H. Omanadze - 2004 - Journal of Symbolic Logic 69 (1):143-158.details
|
|
Automorphism groups of saturated models of peano arithmetic.Ermek S. Nurkhaidarov & James H. Schmerl - 2014 - Journal of Symbolic Logic 79 (2):561-584.details
|
|
On the equational theory of representable polyadic equality algebras.István Németi & Gábor Sági - 2000 - Journal of Symbolic Logic 65 (3):1143-1167.details
|
|
Paper machines.Daniele Mundici & Wilfried Seig - 1995 - Philosophia Mathematica 3 (1):5-30.details
|
|
On the construction of effectively random sets.Wolfgang Merkle & Nenad Mihailović - 2004 - Journal of Symbolic Logic 69 (3):862-878.details
|
|
Cognitive representation of “musical fractals”: Processing hierarchy and recursion in the auditory domain.Mauricio Dias Martins, Bruno Gingras, Estela Puig-Waldmueller & W. Tecumseh Fitch - 2017 - Cognition 161 (C):31-45.details
|
|
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.details
|
|
An almost-universal cupping degree.Jiang Liu & Guohua Wu - 2011 - Journal of Symbolic Logic 76 (4):1137-1152.details
|
|
The∀∃ theory of Peano Σ1 sentences.Per Lindström & V. Yu Shavrukov - 2008 - Journal of Mathematical Logic 8 (2):251-280.details
|
|
Randomness and the linear degrees of computability.Andrew Em Lewis & George Barmpalias - 2007 - Annals of Pure and Applied Logic 145 (3):252-257.details
|
|
Embedding finite lattices into the Σ20 enumeration degrees.Steffen Lempp & Andrea Sorbi - 2002 - Journal of Symbolic Logic 67 (1):69-90.details
|
|
Natural factors of the Muchnik lattice capturing IPC.Rutger Kuyper - 2013 - Annals of Pure and Applied Logic 164 (10):1025-1036.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
|
|
Diagonals and Semihyperhypersimple Sets.Martin Kummer - 1991 - Journal of Symbolic Logic 56 (3):1068-1074.details
|
|
A proof of Beigel's cardinality conjecture.Martin Kummer - 1992 - Journal of Symbolic Logic 57 (2):677-681.details
|
|
Covering the recursive sets.Bjørn Kjos-Hanssen, Frank Stephan & Sebastiaan A. Terwijn - 2017 - Annals of Pure and Applied Logic 168 (4):804-823.details
|
|
On the Difficulty of Writing Out formal Proofs in Arithmetic.Ryo Kashima & Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (3):328-332.details
|
|
A cohesive set which is not high.Carl Jockusch & Frank Stephan - 1993 - Mathematical Logic Quarterly 39 (1):515-530.details
|
|
Counterpossibles in Science: The Case of Relative Computability.Matthias Jenny - 2018 - Noûs 52 (3):530-560.details
|
|
Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice.Hajime Ishihara, Maria Emilia Maietti, Samuele Maschio & Thomas Streicher - 2018 - Archive for Mathematical Logic 57 (7-8):873-888.details
|
|
Language Learning From Positive Evidence, Reconsidered: A Simplicity-Based Approach.Anne S. Hsu, Nick Chater & Paul Vitányi - 2013 - Topics in Cognitive Science 5 (1):35-55.details
|
|
Reflecting in epistemic arithmetic.Leon Horsten - 1996 - Journal of Symbolic Logic 61 (3):788-801.details
|
|
On the jump classes of noncuppable enumeration degrees.Charles M. Harris - 2011 - Journal of Symbolic Logic 76 (1):177 - 197.details
|
|
Jump Operator and Yates Degrees.Guohua Wu - 2006 - Journal of Symbolic Logic 71 (1):252 - 264.details
|
|
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.details
|
|
Schnorr trivial sets and truth-table reducibility.Johanna N. Y. Franklin & Frank Stephan - 2010 - Journal of Symbolic Logic 75 (2):501-521.details
|
|
Anti-Complex Sets and Reducibilities with Tiny Use.Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan & Guohua Wu - 2013 - Journal of Symbolic Logic 78 (4):1307-1327.details
|
|
On the Universal Splitting Property.Rod Downey - 1997 - Mathematical Logic Quarterly 43 (3):311-320.details
|
|
Embedding lattices into the wtt-degrees below 0'.Rod Downey & Christine Haught - 1994 - Journal of Symbolic Logic 59 (4):1360-1382.details
|
|
Degree theoretic definitions of the low2 recursively enumerable sets.Rod Downey & Richard A. Shore - 1995 - Journal of Symbolic Logic 60 (3):727 - 756.details
|
|