• Title: Advances in Proof-Theoretic Semantics
• Author(s) Thomas Piecha, Peter Schroeder-Heister
• Publisher: Springer; 2016th edition; eBook (Creative Commons Licensed)
• License(s): Creative Commons License (CC)
• Hardcover/Paperback: 289 pages
• eBook: PDF and ePub
• Language: English
• ISBN-10/ASIN: 3319226851
• ISBN-13: 978-3319226859
• Share This:  

Book Description

Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume is the first ever collection devoted to the field of proof-theoretic semantics.

• N/A

• Amazon

• Mathematical Logic - Set Theory, Model Theory, Computability, etc
• Linked Data, Semantics, Computational Semantics, Semantic Web

• Advances in Proof-Theoretic Semantics (Thomas Piecha, et al.)
• The Mirror Site (1) - PDF

• Harmony and Paradox: Aspects of Proof-Theoretic Semantics

  This open access book investigates the role played by identity of proofs in proof-theoretic semantics. It develops a conception of proof-theoretic semantics as primarily concerned with the relationship between proofs and derivations.

• Vector Semantics (András Kornai)

  This open access book introduces Vector semantics, which links the formal theory of word vectors to the cognitive theory of linguistics by presenting a formal theory, cast in terms of linear polytopes, that generalizes both word vectors and conceptual structures.

• Semantics with Applications: A Formal Introduction

  This book provides a needed introductory presentation of the fundamental ideas behind Semantics, stresses their relationship by formulating and proving the relevant theorems, and illustrates the applications of semantics in computer science.

• Mathematical Aspects of Logic Programming Semantics

  This book discusses applications of Logic Programming to computational logic and potential applications to the integration of models of computation, knowledge representation and reasoning, and the Semantic Web.

• Introduction to Mathematical Philosophy (Bertrand Russell)

  Requiring neither prior knowledge of mathematics nor aptitude for mathematical symbolism, the book serves as essential reading for anyone interested in the intersection of mathematics and logic and in the development of analytic philosophy.

• Gödel Without (Too Many) Tears (Peter Smith)

  How is this remarkable result of Gödel's Theorems established? This short book explains. The aim is to make the Theorems available, clearly and accessibly, even to those with a quite limited formal background.

• Introduction to Mathematical Logic (Vilnis Detlovs, et al)

  This book explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. Discusses the major results of Gödel, Church, Kleene, Rosser, and Turing.

• A Friendly Introduction to Mathematical Logic (Chris Leary)

  In this user-friendly book, readers with no previous study in the field are introduced to the basics of model theory, proof theory, and computability theory, leading to rigorous proofs of Gödel's First and Second Incompleteness Theorems.

• A Problem Course in Mathematical Logic (Stefan Bilaniuk)

  It is intended to serve as the text for an introduction to mathematical logic for undergraduates with some mathematical sophistication. It supplies definitions, statements of results, and problems, along with some explanations, examples, and hints.

• A Concise Introduction to Mathematical Logic (W. Rautenberg)

  This is a well-written introduction to the beautiful and coherent subject of mathematical logic. It contains classical material such as logical calculi, beginnings of model theory, and Goedel's incompleteness theorems, as well as some topics motivated by applications.

• Sets, Logic, Computation: An Open Introduction to 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.