- A Peircean Reply to Quine's Two Problems.Masato Ishida - 2013 - Transactions of the Charles S. Peirce Society 49 (3):322.details
|
|
Satisfying Predicates: Kleene's Proof of the Hilbert–Bernays Theorem.Gary Ebbs - 2015 - History and Philosophy of Logic 36 (4):346-366.details
|
|
Interpolating d-r.e. and REA degrees between r.e. degrees.Marat Arslanov, Steffen Lempp & Richard A. Shore - 1996 - Annals of Pure and Applied Logic 78 (1-3):29-56.details
|
|
Practical Intractability: A Critique of the Hypercomputation Movement. [REVIEW]Aran Nayebi - 2014 - Minds and Machines 24 (3):275-305.details
|
|
On the possible computational power of the human mind.Hector Zenil & Francisco Hernandez-Quiroz - 2007 - In Carlos Gershenson, Diederik Aerts & Bruce Edmonds (eds.), Worldviews, Science and Us: Philosophy and Complexity. World Scientific. pp. 315--334.details
|
|
The extent of computation in malament–hogarth spacetimes.P. D. Welch - 2008 - British Journal for the Philosophy of Science 59 (4):659-674.details
|
|
Inferring conservation laws in particle physics: A case study in the problem of induction.Oliver Schulte - 2000 - British Journal for the Philosophy of Science 51 (4):771-806.details
|
|
Notes on naive semantics.Hans Herzberger - 1982 - Journal of Philosophical Logic 11 (1):61 - 102.details
|
|
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.details
|
|
A classification of low c.e. sets and the Ershov hierarchy.Marat Faizrahmanov - forthcoming - Mathematical Logic Quarterly.details
|
|
Meeting on Neutral Ground. A Reflection on Man-Machine Contests.Albert Visser - 2020 - Studia Semiotyczne 34 (1):279-294.details
|
|
Tracing Internal Categoricity.Jouko Väänänen - 2020 - Theoria 87 (4):986-1000.details
|
|
Extending and interpreting Post’s programme.S. Cooper - 2010 - Annals of Pure and Applied Logic 161 (6):775-788.details
|
|
Ockham Efficiency Theorem for Stochastic Empirical Methods.Kevin T. Kelly & Conor Mayo-Wilson - 2010 - Journal of Philosophical Logic 39 (6):679-712.details
|
|
(1 other version)The co-discovery of conservation laws and particle families.Oliver Schulte - 2008 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 39 (2):288-314.details
|
|
Efficient convergence implies ockham's razor.Kevin Kelly - 2002 - Proceedings of the 2002 International Workshop on Computational Models of Scientific Reasoning and Applications.details
|
|
What is a Computer? A Survey.William J. Rapaport - 2018 - Minds and Machines 28 (3):385-426.details
|
|
Trial and error mathematics I: Dialectical and quasidialectical systems.Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Giulia Simi & Andrea Sorbi - 2016 - Review of Symbolic Logic 9 (2):299-324.details
|
|
When is a computer not a computer?Peter Kugel - 1986 - Cognition 23 (1):89-94.details
|
|
Computable categoricity and the Ershov hierarchy.Bakhadyr Khoussainov, Frank Stephan & Yue Yang - 2008 - Annals of Pure and Applied Logic 156 (1):86-95.details
|
|
In Search for Optimal Methods: New Insights About Meta-Induction.Gerhard Schurz - 2023 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 54 (3):491-522.details
|
|
Bounded query classes and the difference hierarchy.Richard Beigel, William I. Gasarch & Louise Hay - 1989 - Archive for Mathematical Logic 29 (2):69-84.details
|
|
Fixed-parameter decidability: Extending parameterized complexity analysis.Jouke Witteveen & Leen Torenvliet - 2016 - Mathematical Logic Quarterly 62 (6):596-607.details
|
|
(1 other version)On TAE Machines and Their Computational Power.Apostolos Syropoulos - 2019 - Logica Universalis 13 (2):165-170.details
|
|
(1 other version)Scanlon's contractualism and the redundancy objection.Philip Stratton–Lake - 2003 - Analysis 63 (1):70-76.details
|
|
The No Free Lunch Theorem: Bad News for (white's Account of) the Problem of Induction.Gerhard Schurz - 2021 - Episteme 18 (1):31-45.details
|
|
How to reason defeasibly.John L. Pollock - 1992 - Artificial Intelligence 57 (1):1-42.details
|
|
Recognizing strong random reals.Daniel Osherson - 2008 - Review of Symbolic Logic 1 (1):56-63.details
|
|
On the danger of half-truths.Daniel Osherson & Scott Weinstein - 1995 - Journal of Philosophical Logic 24 (1):85 - 115.details
|
|
(1 other version)Logic and probabilistic systems.Franco Montagna, Giulia Simi & Andrea Sorbi - 1996 - Archive for Mathematical Logic 35 (4):225-261.details
|
|
Self-reference and incompleteness in a non-monotonic setting.Timothy G. Mccarthy - 1994 - Journal of Philosophical Logic 23 (4):423 - 449.details
|
|
Modes of Convergence to the Truth: Steps Toward a Better Epistemology of Induction.L. I. N. Hanti - 2022 - Review of Symbolic Logic 15 (2):277-310.details
|
|
New blades for occam's razor.Bernhard Lauth - 1997 - Erkenntnis 46 (2):241-267.details
|
|
Thinking may be more than computing.Peter Kugel - 1986 - Cognition 22 (2):137-198.details
|
|
The computable testability of theories making uncomputable predictions.Kevin T. Kelly & Oliver Schulte - 1995 - Erkenntnis 43 (1):29 - 66.details
|
|
Justification as truth-finding efficiency: How ockham's razor works.Kevin T. Kelly - 2004 - Minds and Machines 14 (4):485-505.details
|
|
Experimental Logics, Mechanism and Knowable Consistency.Martin Kaså - 2012 - Theoria 78 (3):213-224.details
|
|
Generalization of Shapiro’s theorem to higher arities and noninjective notations.Dariusz Kalociński & Michał Wrocławski - 2022 - Archive for Mathematical Logic 62 (1):257-288.details
|
|
Is gold-Putnam diagonalization complete?Cory Juhl - 1995 - Journal of Philosophical Logic 24 (2):117 - 138.details
|
|
(1 other version)The Undecidability of Propositional Adaptive Logic.Leon Horsten & Philip Welch - 2007 - Synthese 158 (1):41-60.details
|
|
On the Possibility of Inference to the Best Explanation.Clark Glymour - 2012 - Journal of Philosophical Logic 41 (2):461-469.details
|
|
(1 other version)Theory Choice, Theory Change, and Inductive Truth-Conduciveness.Konstantin Genin & Kevin T. Kelly - 2018 - Studia Logica:1-41.details
|
|
Logical Omnipotence and Two notions of Implicit Belief.Danilo Fraga Dantas - 2019 - In Tiegue Vieira Rodrigues (ed.), Epistemologia Analítica: Debates Contemporâneos. Porto Alegre: Editora Fi. pp. 29-46.details
|
|
Discrete transfinite computation models.Philip D. Welch - 2011 - In S. B. Cooper & Andrea Sorbi (eds.), Computability in Context: Computation and Logic in the Real World. World Scientific. pp. 375--414.details
|
|
The modal argument for hypercomputing minds.Selmer Bringsjord - 2004 - Theoretical Computer Science 317.details
|
|