- CO‐Simple Higher‐Order Indecomposable Isols.Jeffery B. Remmel & Alfred B. Manaster - 1980 - Mathematical Logic Quarterly 26 (14-18):279-288.details
|
|
CO‐Simple Higher‐Order Indecomposable Isols.Jeffrey Remmel & Alfred Manaster - 1980 - Mathematical Logic Quarterly 26 (14-18):279-288.details
|
|
Co-hypersimple structures.J. B. Remmel - 1976 - Journal of Symbolic Logic 41 (3):611-625.details
|
|
Is there more than one type of mental algorithm?Ronan G. Reilly - 1987 - Behavioral and Brain Sciences 10 (3):489-490.details
|
|
Ways and means.Adam V. Reed - 1987 - Behavioral and Brain Sciences 10 (3):488-489.details
|
|
Explicit mathematics with the monotone fixed point principle.Michael Rathjen - 1998 - Journal of Symbolic Logic 63 (2):509-542.details
|
|
Reduction Techniques for Proving Decidability in Logics and Their Meet–Combination.João Rasga, Cristina Sernadas & Walter Carnielli - 2021 - Bulletin of Symbolic Logic 27 (1):39-66.details
|
|
Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories.Panu Raatikainen - 2003 - Journal of Symbolic Logic 68 (1):262-266.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
|
|
Scott sentences for equivalence structures.Sara B. Quinn - 2020 - Archive for Mathematical Logic 59 (3-4):453-460.details
|
|
On the Mathematical Foundations of Syntactic Structures.Geoffrey K. Pullum - 2011 - Journal of Logic, Language and Information 20 (3):277-296.details
|
|
The Equivalence of Definitions of Algorithmic Randomness.Christopher Porter - 2021 - Philosophia Mathematica 29 (2):153–194.details
|
|
A survey of propositional realizability logic.Valery Plisko - 2009 - Bulletin of Symbolic Logic 15 (1):1-42.details
|
|
Neural Computation and the Computational Theory of Cognition.Gualtiero Piccinini & Sonya Bahar - 2013 - Cognitive Science 37 (3):453-488.details
|
|
Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.details
|
|
A note on uniform density in weak arithmetical theories.Duccio Pianigiani & Andrea Sorbi - 2020 - Archive for Mathematical Logic 60 (1):211-225.details
|
|
The emperor's old hat.Don Perlis - 1990 - Behavioral and Brain Sciences 13 (4):680-681.details
|
|
The nonalgorithmic mind.Roger Penrose - 1990 - Behavioral and Brain Sciences 13 (4):692-705.details
|
|
Precis of the emperor's new mind.Roger Penrose - 1990 - Behavioral and Brain Sciences 13 (4):643-705.details
|
|
Normalizing notations in the Ershov hierarchy.Cheng Peng - 2021 - Mathematical Logic Quarterly 67 (4):506-513.details
|
|
Substitutional quantification and mathematics. [REVIEW]Charles Parsons - 1982 - British Journal for the Philosophy of Science 33 (4):409-421.details
|
|
On Algorithms, Effective Procedures, and Their Definitions.Philippos Papayannopoulos - 2023 - Philosophia Mathematica 31 (3):291-329.details
|
|
On advancing simple hypotheses.Daniel N. Osherson & Scott Weinstein - 1990 - Philosophy of Science 57 (2):266-277.details
|
|
Ideal Learning Machines.Daniel N. Osherson, Michael Stob & Scott Weinstein - 1982 - Cognitive Science 6 (3):277-290.details
|
|
Mechanical learners pay a price for Bayesianism.Daniel N. Osherson, Michael Stob & Scott Weinstein - 1988 - Journal of Symbolic Logic 53 (4):1245-1251.details
|
|
A universal inductive inference machine.Daniel N. Osherson, Michael Stob & Scott Weinstein - 1991 - Journal of Symbolic Logic 56 (2):661-672.details
|
|
Some remarks on ω-powers of enumerated sets and their applications to ω-operations.Andrzej Orlicki - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (2):149-161.details
|
|
On Constructively Non‐Morphisms of Enumerated Sets and Constructive Non‐Reducibility of Enumerations.Andrzej Orlicki - 1987 - Mathematical Logic Quarterly 33 (6):485-496.details
|
|
On Constructively Non-Morphisms of Enumerated Sets and Constructive Non-Reducibility of Enumerations.Andrzej Orlicki - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):485-496.details
|
|
On Some Problems Related to Enumerated Types of Algebras.Andrzej Orlicki - 1988 - Mathematical Logic Quarterly 34 (6):553-562.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
|
|
r‐Maximal sets and Q1,N‐reducibility.Roland Sh Omanadze & Irakli O. Chitaia - 2021 - Mathematical Logic Quarterly 67 (2):138-148.details
|
|
On the bounded quasi‐degrees of c.e. sets.Roland Sh Omanadze - 2013 - Mathematical Logic Quarterly 59 (3):238-246.details
|
|
On a question of G. E. Sacks.Kempachiro Ohashi - 1970 - Journal of Symbolic Logic 35 (1):46-50.details
|
|
Forcing and Reducibilities.Piergiorgio Odifreddi - 1983 - Journal of Symbolic Logic 48 (2):288-310.details
|
|
Countable functionals and the projective hierarchy.Dag Normann - 1981 - Journal of Symbolic Logic 46 (2):209-215.details
|
|
Equivalences for truth predicates.Carlo Nicolai - 2017 - Review of Symbolic Logic 10 (2):322-356.details
|
|
Steadfast intentions.Keith K. Niall - 1990 - Behavioral and Brain Sciences 13 (4):679-680.details
|
|
Fixed points and diagonal method.Maurizio Negri - 1990 - Mathematical Logic Quarterly 36 (4):319-329.details
|
|
Finite injury and Σ1-induction.Michael Mytilinaios - 1989 - Journal of Symbolic Logic 54 (1):38 - 49.details
|
|
Computability in Quantum Mechanics.Wayne C. Myrvold - 1995 - In Werner De Pauli-Schimanovich, Eckehart Köhler & Friedrich Stadler (eds.), Vienna Circle Institute Yearbook. Kluwer Academic Publishers. pp. 33-46.details
|
|
An Absolutely Independent Set of ΣO01-Sentences.John Myhill - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (7):107-109.details
|
|
On expandability of models of Peano arithmetic. I.Roman Murawski - 1976 - Studia Logica 35 (4):409-419.details
|
|
Subsystems of second-order arithmetic between RCA0 and WKL0.Carl Mummert - 2008 - Archive for Mathematical Logic 47 (3):205-210.details
|
|
The Vectorized Grzegorczyk Hierarchy.Steven S. Muchnick - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):441-480.details
|
|
Kleene's amazing second recursion theorem.Yiannis N. Moschovakis - 2010 - Bulletin of Symbolic Logic 16 (2):189 - 239.details
|
|
The powers of machines and minds.Chris Mortensen - 1990 - Behavioral and Brain Sciences 13 (4):678-679.details
|
|
On computable automorphisms of the rational numbers.A. S. Morozov & J. K. Truss - 2001 - Journal of Symbolic Logic 66 (3):1458-1470.details
|
|