- r‐Maximal sets and Q1,N‐reducibility.Roland Sh Omanadze & Irakli O. Chitaia - 2021 - Mathematical Logic Quarterly 67 (2):138-148.details
|
|
(1 other version)The Significance of Evidence-based Reasoning in Mathematics, Mathematics Education, Philosophy, and the Natural Sciences (2nd edition).Bhupinder Singh Anand - 2024 - Mumbai: DBA Publishing (Second Edition).details
|
|
Advances in Modal Logic, Vol. 13.Nicola Olivetti & Rineke Verbrugge (eds.) - 2020 - College Publications.details
|
|
Incomparability in local structures of s -degrees and Q -degrees.Irakli Chitaia, Keng Meng Ng, Andrea Sorbi & Yue Yang - 2020 - Archive for Mathematical Logic 59 (7-8):777-791.details
|
|
Scott sentences for equivalence structures.Sara B. Quinn - 2020 - Archive for Mathematical Logic 59 (3-4):453-460.details
|
|
Computational Complexity Theory and the Philosophy of Mathematics†.Walter Dean - 2019 - Philosophia Mathematica 27 (3):381-439.details
|
|
Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.details
|
|
Incompleteness Via Paradox and Completeness.Walter Dean - 2020 - Review of Symbolic Logic 13 (3):541-592.details
|
|
(1 other version)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
|
|
The Nature of Appearance in Kant’s Transcendentalism: A Seman- tico-Cognitive Analysis.Sergey L. Katrechko - 2018 - Kantian Journal 37 (3):41-55.details
|
|
Espace, temps et cognition.Francis Bailly & Giuseppe Longo - 2003 - Revue de Synthèse 124 (1):61-118.details
|
|
Strict Finitism, Feasibility, and the Sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.details
|
|
The Truth Assignments That Differentiate Human Reasoning From Mechanistic Reasoning: The Evidence-Based Argument for Lucas' Goedelian Thesis.Bhupinder Singh Anand - 2016 - Cognitive Systems Research 40:35-45.details
|
|
(1 other version)Some independence results for control structures in complete numberings.Sanjay Jain & Jochen Nessel - 2001 - Journal of Symbolic Logic 66 (1):357-382.details
|
|
Every polynomial-time 1-degree collapses if and only if P = PSPACE.Stephen A. Fenner, Stuart A. Kurtz & James S. Royer - 2004 - Journal of Symbolic Logic 69 (3):713-741.details
|
|
Splitting properties of {$n$}-c.e. enumeration degrees.I. Sh Kalimullin - 2002 - Journal of Symbolic Logic 67 (2):537-546.details
|
|
CO‐Simple Higher‐Order Indecomposable Isols.Jeffrey Remmel & Alfred Manaster - 1980 - Mathematical Logic Quarterly 26 (14-18):279-288.details
|
|
Counterpossibles in Science: The Case of Relative Computability.Matthias Jenny - 2018 - Noûs 52 (3):530-560.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
|
|
Dominical categories: recursion theory without elements.Robert A. di Paola & Alex Heller - 1987 - Journal of Symbolic Logic 52 (3):594-635.details
|
|
Experimental logics and Π3 0 theories.Petr Hájek - 1977 - Journal of Symbolic Logic 42 (4):515-522.details
|
|
On subcreative sets and S-reducibility.John T. Gill & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669-677.details
|
|
Reconciling simplicity and likelihood principles in perceptual organization.Nick Chater - 1996 - Psychological Review 103 (3):566-581.details
|
|
Realizability semantics for quantified modal logic: Generalizing flagg’s 1985 construction.Benjamin G. Rin & Sean Walsh - 2016 - Review of Symbolic Logic 9 (4):752-809.details
|
|
(1 other version)Topological Framework for Non‐Priority.Kyriakos Kontostathis - 1991 - Mathematical Logic Quarterly 37 (31-32):495-500.details
|
|
(1 other version)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
|
|
Meeting of the Association for Symbolic Logic, Chicago, 1989.Kenneth Manders - 1990 - Journal of Symbolic Logic 55 (1):436-445.details
|
|
Physics of brain-mind interaction.John C. Eccles - 1990 - Behavioral and Brain Sciences 13 (4):662-663.details
|
|
Computability, consciousness, and algorithms.Robert Wilensky - 1990 - Behavioral and Brain Sciences 13 (4):690-691.details
|
|
Minds beyond brains and algorithms.Jan M. Zytkow - 1990 - Behavioral and Brain Sciences 13 (4):691-692.details
|
|
On “seeing” the truth of the Gödel sentence.George Boolos - 1990 - Behavioral and Brain Sciences 13 (4):655-656.details
|
|
Lucas revived? An undefended flank.Jeremy Butterfield - 1990 - Behavioral and Brain Sciences 13 (4):658-658.details
|
|
Interactive instructional systems and models of human problem solving.Edward P. Stabler - 1987 - Behavioral and Brain Sciences 10 (3):493-494.details
|
|
Applying Marr to memory.Keith Stenning - 1987 - Behavioral and Brain Sciences 10 (3):494-495.details
|
|
The study of cognition and instructional design: Mutual nurturance.Robert Glaser - 1987 - Behavioral and Brain Sciences 10 (3):483-484.details
|
|
Is there more than one type of mental algorithm?Ronan G. Reilly - 1987 - Behavioral and Brain Sciences 10 (3):489-490.details
|
|
Connectionism and implementation.Paul Smolensky - 1987 - Behavioral and Brain Sciences 10 (3):492-493.details
|
|
Functional principles and situated problem solving.William J. Clancey - 1987 - Behavioral and Brain Sciences 10 (3):479-480.details
|
|
(1 other version)Cupping and noncupping in the enumeration degrees of ∑20 sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.details
|
|
Computability of String Functions Over Algebraic Structures Armin Hemmerling.Armin Hemmerling - 1998 - Mathematical Logic Quarterly 44 (1):1-44.details
|
|
A variant of the Notion of Semicreative set.Heinrich Rolletschek - 1993 - Mathematical Logic Quarterly 39 (1):33-46.details
|
|
(1 other version)The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions.Gregory A. Riccardi - 1982 - Mathematical Logic Quarterly 28 (20‐21):285-296.details
|
|
Subsystems of second-order arithmetic between RCA0 and WKL0.Carl Mummert - 2008 - Archive for Mathematical Logic 47 (3):205-210.details
|
|
(1 other version)Elementary Formal Systems for Hyperarithmetical Relations.Melvin Fitting - 1978 - Mathematical Logic Quarterly 24 (1‐6):25-30.details
|
|
(1 other version)A Classification of the Recursive Functions.Albert R. Meyer & Dennis M. Ritchie - 1972 - Mathematical Logic Quarterly 18 (4‐6):71-82.details
|
|
A note on definability in fragments of arithmetic with free unary predicates.Stanislav O. Speranski - 2013 - Archive for Mathematical Logic 52 (5-6):507-516.details
|
|
Approaches to Effective Semi‐Continuity of Real Functions.Xizhong Zheng, Vasco Brattka & Klaus Weihrauch - 1999 - Mathematical Logic Quarterly 45 (4):481-496.details
|
|
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.details
|
|
On Σ1 1 equivalence relations over the natural numbers.Ekaterina B. Fokina & Sy-David Friedman - 2012 - Mathematical Logic Quarterly 58 (1-2):113-124.details
|
|
Computability in Quantum Mechanics.Wayne C. Myrvold - 1995 - In Werner DePauli-Schimanovich, Eckehart Köhler & Friedrich Stadler (eds.), The Foundational Debate: Complexity and Constructivity in Mathematics and Physics. Dordrecht, Boston and London: Kluwer Academic Publishers. pp. 33-46.details
|
|