- Constructive mathematics with the knowledge predicate K satisfied by every currently known theorem.Apoloniusz Tyszka - manuscriptdetails
|
|
Truth, Pretense and the Liar Paradox.Bradley Armour-Garb & James A. Woodbridge - 2015 - In T. Achourioti, H. Galinon, J. Martínez Fernández & K. Fujimoto (eds.), Unifying the Philosophy of Truth. Dordrecht: Imprint: Springer. pp. 339-354.details
|
|
Constructivity and Computability in Historical and Philosophical Perspective.Jacques Dubucs & Michel Bourdeau (eds.) - 2014 - Dordrecht, Netherland: Springer.details
|
|
The Significance of Evidence-based Reasoning for Mathematics, Mathematics Education, Philosophy and the Natural Sciences.Bhupinder Singh Anand - forthcomingdetails
|
|
Learning to coordinate; a recursion theoretic perspective.Franco Montagna & Daniel Osherson - 1999 - Synthese 118 (3):363-382.details
|
|
Minds beyond brains and algorithms.Jan M. Zytkow - 1990 - Behavioral and Brain Sciences 13 (4):691-692.details
|
|
On the Topological Size of Sets of Random Strings.M. Zimand - 1986 - Mathematical Logic Quarterly 32 (6):81-88.details
|
|
On the Topological Size of Sets of Random Strings.M. Zimand - 1986 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 32 (6):81-88.details
|
|
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.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 the nonboundability of total effective operators.Thomas Zeugmann - 1984 - Mathematical Logic Quarterly 30 (9‐11):169-172.details
|
|
On the nonboundability of total effective operators.Thomas Zeugmann - 1984 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (9-11):169-172.details
|
|
A New Reducibility between Turing‐ and wtt‐Reducibility.Sui Yuefei - 1994 - Mathematical Logic Quarterly 40 (1):106-110.details
|
|
Some Non‐Recursive Classes of Thue Systems With Solvable Word Problem.Ann Yasuhara - 1974 - Mathematical Logic Quarterly 20 (8-12):121-132.details
|
|
Diagonalization in double frames.Andrzej Wiśniewski & Jerzy Pogonowski - 2010 - Logica Universalis 4 (1):31-39.details
|
|
Self-verifying axiom systems, the incompleteness theorem and related reflection principles.Dan Willard - 2001 - Journal of Symbolic Logic 66 (2):536-596.details
|
|
Computability, consciousness, and algorithms.Robert Wilensky - 1990 - Behavioral and Brain Sciences 13 (4):690-691.details
|
|
Situated action, symbol systems and universal computation.Andrew Wells - 1996 - Minds and Machines 6 (1):33-46.details
|
|
Is there a nonrecursive decidable equational theory?Benjamin Wells - 2002 - Minds and Machines 12 (2):301-324.details
|
|
Embeddings in the Strong Reducibilities Between 1 and npm.Phil Watson - 1997 - Mathematical Logic Quarterly 43 (4):559-568.details
|
|
Penrose's grand unified mystery.David Waltz & James Pustejovsky - 1990 - Behavioral and Brain Sciences 13 (4):688-690.details
|
|
Arithmetische und Bairesche Operatoren.Klaus Wagner - 1976 - Mathematical Logic Quarterly 23 (7‐12):181-191.details
|
|
Arithmetische und Bairesche Operatoren.Klaus Wagner - 1977 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 23 (7-12):181-191.details
|
|
Arithmetische Operatoren.Klaus Wagner - 1976 - Mathematical Logic Quarterly 22 (1):553-570.details
|
|
Arithmetische Operatoren.Klaus Wagner - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):553-570.details
|
|
Relativized Cylindrification.Vladeta Vuckovic - 1982 - Mathematical Logic Quarterly 28 (8‐12):167-172.details
|
|
Relativized Cylindrification.Vladeta Vuckovic - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (8-12):167-172.details
|
|
Almost Recursivity and Partial Degrees.Vladeta Vuckovic - 1974 - Mathematical Logic Quarterly 20 (25‐27):419-426.details
|
|
Almost Recursivity and Partial Degrees.Vladeta Vuckovic - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (25-27):419-426.details
|
|
Random reals and possibly infinite computations Part I: Randomness in ∅'.Verónica Becher & Serge Grigorieff - 2005 - Journal of Symbolic Logic 70 (3):891-913.details
|
|
Adaptive logics using the minimal abnormality strategy are P 1 1 \pi^1_1 -complex.Peter Verdée - 2009 - Synthese 167 (1):93 - 104.details
|
|
Between Turing and quantum mechanics there is body to be found.Francisco J. Varela - 1990 - Behavioral and Brain Sciences 13 (4):687-688.details
|
|
The finite model property and recursive Bounds on the size of countermodels.Dolph Ulrich - 1983 - Journal of Philosophical Logic 12 (4):477 - 480.details
|
|
Exactly which emperor is Penrose talking about?John K. Tsotsos - 1990 - Behavioral and Brain Sciences 13 (4):686-687.details
|
|
Learning is critical, not implementation versus algorithm.James T. Townsend - 1987 - Behavioral and Brain Sciences 10 (3):497-497.details
|
|
Some Reflections on the Foundations of Ordinary Recursion Theory and a New Proposal.George Tourlakis - 1986 - Mathematical Logic Quarterly 32 (31-34):503-515.details
|
|
Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles.George Tourlakis - 1996 - Mathematical Logic Quarterly 42 (1):449-460.details
|
|
Connectionist models are also algorithmic.David S. Touretzky - 1987 - Behavioral and Brain Sciences 10 (3):496-497.details
|
|
The Concept of n‐Cylinder and its Application.M. B. Thuraisingham - 1986 - Mathematical Logic Quarterly 32 (13‐16):211-219.details
|
|
The Concept of n‐Cylinder and its Application.M. B. Thuraisingham - 1986 - Mathematical Logic Quarterly 32 (13-16):211-219.details
|
|
Recursive and r.e. quotient Boolean algebras.John J. Thurber - 1994 - Archive for Mathematical Logic 33 (2):121-129.details
|
|
Representation of One‐One Degrees by n‐Cylindrical Decision Problems.M. B. Thuraisingham - 1988 - Mathematical Logic Quarterly 34 (6):481-490.details
|
|
Representation of One-One Degrees byn-Cylindrical Decision Problems.M. B. Thuraisingham - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):481-490.details
|
|
Reducibility Relationships Between Decision Problems for System Functions.M. B. Thuraisingham - 1987 - Mathematical Logic Quarterly 33 (4):305-312.details
|
|
System functions and their decision problems.M. B. Thuraisingham - 1984 - Mathematical Logic Quarterly 30 (7‐8):119-128.details
|
|
System Functions and Their Decision Problems.M. B. Thuraisingham - 1984 - Mathematical Logic Quarterly 30 (7-8):119-128.details
|
|
System function languages.M. B. Thuraisingham - 1993 - Mathematical Logic Quarterly 39 (1):357-366.details
|
|
The bi-embeddability relation for finitely generated groups II.Simon Thomas & Jay Williams - 2016 - Archive for Mathematical Logic 55 (3-4):385-396.details
|
|
Martin’s conjecture and strong ergodicity.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):749-759.details
|
|
Continuous versus Borel reductions.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):761-770.details
|
|