A Short Introduction to Intuitionistic Logic [electronic resource] /

Intuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order logic. One device for making this book short was inventing new proofs of several theorems. The presentation is based on natural deduction. The topics include programming interpretation of intuitionistic logic by simply typed lambda-calculus (Curry-Howard isomorphism), negative translation of classical into intuitionistic logic, normalization of natural deductions, applications to category theory, Kripke models, algebraic and topological semantics, proof-search methods, interpolation theorem. The text developed from materal for several courses taught at Stanford University in 1992-1999.

Saved in:
Bibliographic Details
Main Authors: Mints, Grigori. author., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Boston, MA : Springer US, 2000
Subjects:Mathematics., Logic., Computer science, Mathematical logic., Mathematical Logic and Foundations., Mathematics of Computing.,
Online Access:http://dx.doi.org/10.1007/b115304
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:208986
record_format koha
spelling KOHA-OAI-TEST:2089862018-07-30T23:40:05ZA Short Introduction to Intuitionistic Logic [electronic resource] / Mints, Grigori. author. SpringerLink (Online service) textBoston, MA : Springer US,2000.engIntuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order logic. One device for making this book short was inventing new proofs of several theorems. The presentation is based on natural deduction. The topics include programming interpretation of intuitionistic logic by simply typed lambda-calculus (Curry-Howard isomorphism), negative translation of classical into intuitionistic logic, normalization of natural deductions, applications to category theory, Kripke models, algebraic and topological semantics, proof-search methods, interpolation theorem. The text developed from materal for several courses taught at Stanford University in 1992-1999.Intuitionistic Predicate Logic -- Natural Deduction System NJ -- Kripke Models for Predicate Logic -- Systems LJm, LJ -- Proof-Search in Predicate Logic -- Preliminaries -- Natural Deduction for Propositional Logic -- Negative Translation: Glivenko’s Theorem -- Program Interpretation of Intuitionistic Logic -- Computations with Deductions -- Coherence Theorem -- Kripke Models -- Gentzen-type Propositional System LJpm -- Topological Completeness -- Proof-search -- System LJp -- Interpolation Theorem.Intuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order logic. One device for making this book short was inventing new proofs of several theorems. The presentation is based on natural deduction. The topics include programming interpretation of intuitionistic logic by simply typed lambda-calculus (Curry-Howard isomorphism), negative translation of classical into intuitionistic logic, normalization of natural deductions, applications to category theory, Kripke models, algebraic and topological semantics, proof-search methods, interpolation theorem. The text developed from materal for several courses taught at Stanford University in 1992-1999.Mathematics.Logic.Computer scienceMathematical logic.Mathematics.Mathematical Logic and Foundations.Logic.Mathematics of Computing.Springer eBookshttp://dx.doi.org/10.1007/b115304URN:ISBN:9780306469756
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Mathematics.
Logic.
Computer science
Mathematical logic.
Mathematics.
Mathematical Logic and Foundations.
Logic.
Mathematics of Computing.
Mathematics.
Logic.
Computer science
Mathematical logic.
Mathematics.
Mathematical Logic and Foundations.
Logic.
Mathematics of Computing.
spellingShingle Mathematics.
Logic.
Computer science
Mathematical logic.
Mathematics.
Mathematical Logic and Foundations.
Logic.
Mathematics of Computing.
Mathematics.
Logic.
Computer science
Mathematical logic.
Mathematics.
Mathematical Logic and Foundations.
Logic.
Mathematics of Computing.
Mints, Grigori. author.
SpringerLink (Online service)
A Short Introduction to Intuitionistic Logic [electronic resource] /
description Intuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order logic. One device for making this book short was inventing new proofs of several theorems. The presentation is based on natural deduction. The topics include programming interpretation of intuitionistic logic by simply typed lambda-calculus (Curry-Howard isomorphism), negative translation of classical into intuitionistic logic, normalization of natural deductions, applications to category theory, Kripke models, algebraic and topological semantics, proof-search methods, interpolation theorem. The text developed from materal for several courses taught at Stanford University in 1992-1999.
format Texto
topic_facet Mathematics.
Logic.
Computer science
Mathematical logic.
Mathematics.
Mathematical Logic and Foundations.
Logic.
Mathematics of Computing.
author Mints, Grigori. author.
SpringerLink (Online service)
author_facet Mints, Grigori. author.
SpringerLink (Online service)
author_sort Mints, Grigori. author.
title A Short Introduction to Intuitionistic Logic [electronic resource] /
title_short A Short Introduction to Intuitionistic Logic [electronic resource] /
title_full A Short Introduction to Intuitionistic Logic [electronic resource] /
title_fullStr A Short Introduction to Intuitionistic Logic [electronic resource] /
title_full_unstemmed A Short Introduction to Intuitionistic Logic [electronic resource] /
title_sort short introduction to intuitionistic logic [electronic resource] /
publisher Boston, MA : Springer US,
publishDate 2000
url http://dx.doi.org/10.1007/b115304
work_keys_str_mv AT mintsgrigoriauthor ashortintroductiontointuitionisticlogicelectronicresource
AT springerlinkonlineservice ashortintroductiontointuitionisticlogicelectronicresource
AT mintsgrigoriauthor shortintroductiontointuitionisticlogicelectronicresource
AT springerlinkonlineservice shortintroductiontointuitionisticlogicelectronicresource
_version_ 1756268597548679168