- Is Relativism Self‐Refuting?John Weckert - 1984 - Educational Philosophy and Theory 16 (2):29-42.details
|
|
Kurt Gödel and Computability Theory.Richard Zach - 2006 - In Beckmann Arnold, Berger Ulrich, Löwe Benedikt & Tucker John V. (eds.), Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea. Proceedings. Springer. pp. 575--583.details
|
|
The development of mathematical logic from Russell to Tarski, 1900-1935.Paolo Mancosu, Richard Zach & Calixto Badesa - 2011 - In Leila Haaparanta (ed.), The development of modern logic. New York: Oxford University Press.details
|
|
Codes and Codings in Crisis.Adrian Mackenzie & Theo Vurdubakis - 2011 - Theory, Culture and Society 28 (6):3-23.details
|
|
Grundlagen der Logik und Mathematik: Der Standpunkt Wittgensteins.Timm Lampert - 2003 - In Lampert Timm (ed.), Knowledge and Belief. pp. 44-51.details
|
|
Introduction to the Routledge Handbook of Propositions.Adam Russell Murray & Chris Tillman - 2022 - In Chris Tillman & Adam Murray (eds.), The Routledge Handbook of Propositions. Routledge.details
|
|
Decidable Fragments of the Quantified Argument Calculus.Edi Pavlović & Norbert Gratzl - forthcoming - Review of Symbolic Logic:1-26.details
|
|
Variations on the Kripke Trick.Mikhail Rybakov & Dmitry Shkatov - forthcoming - Studia Logica:1-48.details
|
|
Why Machines Will Never Rule the World: Artificial Intelligence without Fear.Jobst Landgrebe & Barry Smith - 2022 - Abingdon, England: Routledge.details
|
|
Epistemologia Analítica, Vol .1: debates contemporâneos.Tiegue Vieira Rodrigues (ed.) - 2019 - Editora Fi.details
|
|
Enciclopédia de Termos Lógico-Filosóficos.João Miguel Biscaia Branquinho, Desidério Murcho & Nelson Gonçalves Gomes (eds.) - 2006 - São Paulo, SP, Brasil: Martins Fontes.details
|
|
Incompleteness and Computability: An Open Introduction to Gödel's Theorems.Richard Zach - 2019 - Open Logic Project.details
|
|
Sets, Logic, Computation: An Open Introduction to Metalogic.Richard Zach - 2021 - Open Logic Project.details
|
|
Frank Ramsey and the Realistic Spirit.Steven Methven - 2014 - London and Basingstoke: Palgrave Macmillan.details
|
|
Heinrich Behmann’s 1921 lecture on the decision problem and the algebra of logic.Paolo Mancosu & Richard Zach - 2015 - Bulletin of Symbolic Logic 21 (2):164-187.details
|
|
Does changing the subject from A to B really provide an enlarged understanding of A?John Woods - 2016 - Logic Journal of the IGPL 24 (4).details
|
|
On A. A. Markov's Attitude towards Brouwer's Intuitionism.Ioannis M. Vandoulakis - 2015 - Philosophia Scientiae 19:143-158.details
|
|
Completeness and partial soundness results for intersection and union typing for http://ars. els-cdn. com/content/image/http://origin-ars. els-cdn. com/content/image/1-s2. 0-S0168007210000515-si1. gif"/>. [REVIEW]Steffen van Bakel - 2010 - Annals of Pure and Applied Logic 161 (11):1400-1430.details
|
|
Completeness and partial soundness results for intersection and union typing for λ ¯ μ μ ̃.Steffen van Bakel - 2010 - Annals of Pure and Applied Logic 161 (11):1400-1430.details
|
|
The Internal Logic and Finite Colimits.William Troiani - forthcoming - Logica Universalis:1-40.details
|
|
Learning is critical, not implementation versus algorithm.James T. Townsend - 1987 - Behavioral and Brain Sciences 10 (3):497-497.details
|
|
Connectionist models are also algorithmic.David S. Touretzky - 1987 - Behavioral and Brain Sciences 10 (3):496-497.details
|
|
Logic, Mathematics, and the A Priori, Part I: A Problem for Realism.Neil Tennant - 2014 - Philosophia Mathematica 22 (3):308-320.details
|
|
What is the algorithmic level?M. M. Taylor & R. A. Pigeau - 1987 - Behavioral and Brain Sciences 10 (3):495-496.details
|
|
Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski.Alfred Tarski & Hourya Sinaceur - 2000 - Bulletin of Symbolic Logic 6 (1):1-44.details
|
|
Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski. [REVIEW]Alfred Tarski & Hourya Sinaceur - 2000 - Bulletin of Symbolic Logic 6 (1):1-44.details
|
|
Kan maskiner få generell intelligens? En kritisk drøfting av Landgrebe og Smiths bok Why Machines Will Never Rule the World.Atle Ottesen Søvik - 2023 - Norsk Filosofisk Tidsskrift 58 (2-3):141-152.details
|
|
Applying Marr to memory.Keith Stenning - 1987 - Behavioral and Brain Sciences 10 (3):494-495.details
|
|
Interactive instructional systems and models of human problem solving.Edward P. Stabler - 1987 - Behavioral and Brain Sciences 10 (3):493-494.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
|
|
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.details
|
|
Alan Turing: person of the XXth century?José M. Sánchez Ron - 2013 - Arbor 189 (764):a085.details
|
|
Connectionism and implementation.Paul Smolensky - 1987 - Behavioral and Brain Sciences 10 (3):492-493.details
|
|
Step by recursive step: Church's analysis of effective calculability.Wilfried Sieg - 1997 - Bulletin of Symbolic Logic 3 (2):154-180.details
|
|
Two dogmas of computationalism.Oron Shagrir - 1997 - Minds and Machines 7 (3):321-44.details
|
|
Physical hypercomputation and the church–turing thesis.Oron Shagrir & Itamar Pitowsky - 2003 - Minds and Machines 13 (1):87-101.details
|
|
Levels of research.Colleen Seifert & Donald A. Norman - 1987 - Behavioral and Brain Sciences 10 (3):490-492.details
|
|
On Content.Nathan Salmon - 1992 - Mind 101 (404):733-751.details
|
|
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter.Mikhail Rybakov & Dmitry Shkatov - 2018 - Studia Logica 107 (4):695-717.details
|
|
Undecidability of the Logic of Partial Quasiary Predicates.Mikhail Rybakov & Dmitry Shkatov - 2022 - Logic Journal of the IGPL 30 (3):519-533.details
|
|
Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness.Mikhail Rybakov - forthcoming - Logic Journal of the IGPL.details
|
|
Weak versus strong claims about the algorithmic level.Paul S. Rosenbloom - 1987 - Behavioral and Brain Sciences 10 (3):490-490.details
|
|
Is there more than one type of mental algorithm?Ronan G. Reilly - 1987 - Behavioral and Brain Sciences 10 (3):489-490.details
|
|
Ways and means.Adam V. Reed - 1987 - Behavioral and Brain Sciences 10 (3):488-489.details
|
|
Turing, Wittgenstein and the science of the mind.Diane Proudfoot & Jack Copeland - 1994 - Australasian Journal of Philosophy 72:497-519.details
|
|
On the Digital Ocean.Sarah Pourciau - 2022 - Critical Inquiry 48 (2):233-261.details
|
|
Effective Computation by Humans and Machines.Shagrir Oron - 2002 - Minds and Machines 12 (2):221-240.details
|
|
A Syntactic Proof of the Decidability of First-Order Monadic Logic.Eugenio Orlandelli & Matteo Tesi - forthcoming - Bulletin of the Section of Logic.details
|
|
2011 North American Annual Meeting of the Association for Symbolic Logic.Itay Neeman - 2012 - Bulletin of Symbolic Logic 18 (2):275-305.details
|
|
Machine intelligence: a chimera.Mihai Nadin - 2019 - AI and Society 34 (2):215-242.details
|
|