- Epistemologia Analítica, Vol .1: debates contemporâneos.Tiegue Vieira Rodrigues (ed.) - 2019 - Editora Fi.details
|
|
Causation, Prediction, and Search.Peter Spirtes, Clark Glymour, Scheines N. & Richard - 1993 - Mit Press: Cambridge.details
|
|
Fixed-parameter decidability: Extending parameterized complexity analysis.Jouke Witteveen & Leen Torenvliet - 2016 - Mathematical Logic Quarterly 62 (6):596-607.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
|
|
Tracing Internal Categoricity.Jouko Väänänen - 2020 - Theoria 87 (4):986-1000.details
|
|
Meeting on Neutral Ground. A Reflection on Man-Machine Contests.Albert Visser - 2020 - Studia Semiotyczne 34 (1):279-294.details
|
|
On TAE Machines and Their Computational Power.Apostolos Syropoulos - 2019 - Logica Universalis 13 (2):165-170.details
|
|
Scanlon's contractualism and the redundancy objection.Philip Stratton–Lake - 2003 - Analysis 63 (1):70-76.details
|
|
Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.details
|
|
Uniform Density in Lindenbaum Algebras.V. Yu Shavrukov & Albert Visser - 2014 - Notre Dame Journal of Formal Logic 55 (4):569-582.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
|
|
The logic of reliable and efficient inquiry.Oliver Schulte - 1999 - Journal of Philosophical Logic 28 (4):399-438.details
|
|
The Impact of Meta-Induction: From Skepticism to Optimality.Gerhard Schurz - 2021 - Philosophies 6 (4):95.details
|
|
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
|
|
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
|
|
Reichenbach's best alternative account to the problem of induction.Gerhard Schurz - 2021 - Synthese 199 (3-4):10827-10838.details
|
|
Optimality justifications and the optimality principle: New tools for foundation‐theoretic epistemology.Gerhard Schurz - 2022 - Noûs 56 (4):972-999.details
|
|
Means-ends epistemology.O. Schulte - 1999 - British Journal for the Philosophy of Science 50 (1):1-31.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
|
|
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
|
|
Causal Learning with Occam’s Razor.Oliver Schulte - 2019 - Studia Logica 107 (5):991-1023.details
|
|
What is a Computer? A Survey.William J. Rapaport - 2018 - Minds and Machines 28 (3):385-426.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
|
|
Algorithmic information theory and undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.details
|
|
How to reason defeasibly.John L. Pollock - 1992 - Artificial Intelligence 57 (1):1-42.details
|
|
Lying, computers and self-awareness.Castro Paulo - 2020 - Kairos 24 (1):10–34.details
|
|
On the danger of half-truths.Daniel Osherson & Scott Weinstein - 1995 - Journal of Philosophical Logic 24 (1):85 - 115.details
|
|
Recognizing strong random reals.Daniel Osherson - 2008 - Review of Symbolic Logic 1 (1):56-63.details
|
|
Practical Intractability: A Critique of the Hypercomputation Movement. [REVIEW]Aran Nayebi - 2014 - Minds and Machines 24 (3):275-305.details
|
|
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
|
|
Gödel's Third Incompleteness Theorem.Timothy McCarthy - 2016 - Dialectica 70 (1):87-112.details
|
|
Ockham Efficiency Theorem for Stochastic Empirical Methods.Kevin T. Kelly & Conor Mayo-Wilson - 2010 - Journal of Philosophical Logic 39 (6):679-712.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
|
|
When is a computer not a computer?Peter Kugel - 1986 - Cognition 23 (1):89-94.details
|
|
Computing machines can't be intelligent (...And Turing said so).Peter Kugel - 2002 - Minds and Machines 12 (4):563-579.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
|
|
The computable testability of theories making uncomputable predictions.Kevin T. Kelly & Oliver Schulte - 1995 - Erkenntnis 43 (1):29 - 66.details
|
|
Realism, rhetoric, and reliability.Kevin T. Kelly, Konstantin Genin & Hanti Lin - 2016 - Synthese 193 (4):1191-1223.details
|
|
Justification as truth-finding efficiency: How ockham's razor works.Kevin T. Kelly - 2004 - Minds and Machines 14 (4):485-505.details
|
|
A new solution to the puzzle of simplicity.Kevin T. Kelly - 2007 - Philosophy of Science 74 (5):561-573.details
|
|
Experimental Logics, Mechanism and Knowable Consistency.Martin Kaså - 2012 - Theoria 78 (3):213-224.details
|
|
A Logic for Trial and Error Classifiers.Martin Kaså - 2015 - Journal of Logic, Language and Information 24 (3):307-322.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
|
|
Infima in the d.r.e. degrees.D. Kaddah - 1993 - Annals of Pure and Applied Logic 62 (3):207-263.details
|
|
Is gold-Putnam diagonalization complete?Cory Juhl - 1995 - Journal of Philosophical Logic 24 (2):117 - 138.details
|
|
On the r.e. predecessors of d.r.e. degrees.Shamil Ishmukhametov - 1999 - Archive for Mathematical Logic 38 (6):373-386.details
|
|
A Peircean Reply to Quine's Two Problems.Masato Ishida - 2013 - Transactions of the Charles S. Peirce Society 49 (3):322.details
|
|