Sets, Logic, Computation: An Open Introduction to Metalogic

Open Logic Project (2021)
  Copy   BIBTEX

Abstract

An introductory textbook on metalogic. It covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and of first-order logic. The audience is undergraduate students with some background in formal logic.

Categories

Keywords

Reprint years

2019

ISBN(s)

1077322127   9781077322127
View all bargains

Buy this book

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Transcending Turing computability.B. J. Maclennan - 2003 - Minds and Machines 13 (1):3-22.
Undecidability over Continuous Time.Jerzy Mycka & José Félix Costa - 2006 - Logic Journal of the IGPL 14 (5):649-658.
Logically possible machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.
Reflections on gödel's and Gandy's reflections on Turing's thesis.David Israel - 2002 - Minds and Machines 12 (2):181-201.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Infinite Computations with Random Oracles.Merlin Carl & Philipp Schlicht - 2017 - Notre Dame Journal of Formal Logic 58 (2):249-270.
Introduction to mathematical logic.Michał Walicki - 2012 - Hackensack, NJ: World Scientific.
Observability of Turing Machines: a refinement of the theory of computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Extensionalizing Intensional Second-Order Logic.Jonathan Payne - 2015 - Notre Dame Journal of Formal Logic 56 (1):243-261.
Introduction to Turing categories.J. Robin B. Cockett & Pieter Jw Hofstra - 2008 - Annals of Pure and Applied Logic 156 (2):183-209.
Do Accelerating Turing Machines Compute the Uncomputable?B. Jack Copeland & Oron Shagrir - 2011 - Minds and Machines 21 (2):221-239.
Computation in cognitive science: it is not all about Turing-equivalent computation.Kenneth Aizawa - 2010 - Studies in History and Philosophy of Science Part A 41 (3):227-236.

Analytics

Added to PP
2019-04-04

Downloads
1,524 (#6,630)

6 months
813 (#1,355)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Richard Zach
University of Calgary

Citations of this work

No citations found.

Add more citations

References found in this work

On Denoting.Bertrand Russell - 1905 - Mind 14 (56):479-493.
On Denoting.Bertrand Russell - 2005 - Mind 114 (456):873 - 887.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Set Theory and its Philosophy: A Critical Introduction.Michael D. Potter - 2004 - Oxford, England: Oxford University Press.
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.

View all 24 references / Add more references