- Joule’s Experiment as an Event Triggering a Formalization of a Baconian Science Till Up to an Alternative Theory to Newton’s One.Antonino Drago - 2020 - Foundations of Science 26 (3):585-605.details
|
|
Complexity, Decidability and Completeness.Douglas Cenzer & Jeffrey B. Remmel - 2006 - Journal of Symbolic Logic 71 (2):399 - 424.details
|
|
Myhill's work in recursion theory.J. C. E. Dekker & E. Ellentuck - 1992 - Annals of Pure and Applied Logic 56 (1-3):43-71.details
|
|
Complete, Recursively Enumerable Relations in Arithmetic.Giovanna D'Agostino & Mario Magnago - 1995 - Mathematical Logic Quarterly 41 (1):65-72.details
|
|
Polynomial clone reducibility.Quinn Culver - 2014 - Archive for Mathematical Logic 53 (1-2):1-10.details
|
|
Degree spectra of the successor relation of computable linear orderings.Jennifer Chubb, Andrey Frolov & Valentina Harizanov - 2009 - Archive for Mathematical Logic 48 (1):7-13.details
|
|
The strength of the Grätzer-Schmidt theorem.Katie Brodhead, Mushfeq Khan, Bjørn Kjos-Hanssen, William A. Lampe, Paul Kim Long V. Nguyen & Richard A. Shore - 2016 - Archive for Mathematical Logic 55 (5-6):687-704.details
|
|
Weihrauch degrees, omniscience principles and weak computability.Vasco Brattka & Guido Gherardi - 2011 - Journal of Symbolic Logic 76 (1):143 - 176.details
|
|
Effective choice and boundedness principles in computable analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.details
|
|
Proving church's thesis.Robert Black - 2000 - Philosophia Mathematica 8 (3):244--58.details
|
|
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.details
|
|
Hypersimplicity and semicomputability in the weak truth table degrees.George Barmpalias - 2005 - Archive for Mathematical Logic 44 (8):1045-1065.details
|
|
Π 1 0 classes, L R degrees and Turing degrees.George Barmpalias, Andrew E. M. Lewis & Frank Stephan - 2008 - Annals of Pure and Applied Logic 156 (1):21-38.details
|
|
Approximation Representations for Δ2 Reals.George Barmpalias - 2004 - Archive for Mathematical Logic 43 (8):947-964.details
|
|
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent.Klaus Ambos-Spies, Philipp Bodewig, Yun Fan & Thorsten Kräling - 2013 - Annals of Pure and Applied Logic 164 (5):577-588.details
|
|
Turing machines.David Barker-Plummer - 2008 - Stanford Encyclopedia of Philosophy.details
|
|
Statements and open problems on decidable sets X⊆N that contain informal notions and refer to the current knowledge on X.Apoloniusz Tyszka - 2022 - Journal of Applied Computer Science and Mathematics 16 (2):31-35.details
|
|
Laskettavuuden teorian varhaishistoria.Panu Raatikainen - 1995 - In Älyn oppihistoria – matka logiikan, psykologian ja tekoälyn juurille. Espoo: Finnish Artificial Intelligence Society.details
|
|
Matematika a skúsenosť.Ladislav Kvasz - 2009 - Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 16 (2):146-182.details
|
|
Emil Post.Alasdair Urquhart - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 5--617.details
|
|
Universality of functional systems and totality of their elements – the limits of conflict and mutual influence.Jerzy Mycka - 2017 - Philosophical Problems in Science 63:31-58.details
|
|