𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Advances in proof-theoretic semantics

✍ Scribed by Piecha, Thomas;Schroeder-Heister, Peter Joseph


Publisher
Springer
Year
2016
Tongue
English
Leaves
281
Series
Trends in logic 43
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Table of Contents


Chapter 1. Introduction
Thomas Piecha & Peter-Schroeder-Heister.- Chapter 2. On Brouwer-Heyting-Kolmogorov provability semantics
Sergei N. Artemov.- Chapter 3. Two Ways of General Proof Theory
Kosta Dosen.- Chapter 4. Generalised elimination rules
Roy Dyckhoff.- Chapter 5. On the proof theoretic foundations of set theory
Lars Hallnas.- Chapter 6. The choice of semantics as a methodological question
Wilfrid Hodges.- Chapter 7. The mode of presentation
Reinhard Kahle.- Chapter 8. Remarks on relations between Gentzen and Heyting inspired PTS
Dag Prawitz.- Chapter 9. Unification of logics by reflection
Giovanni Sambin.- Chapter 10. BHK and Brouwer's Theory of the Creative Subject
Goeran Sundholm.- Chapter 11. Compositional semantics for predicate logic: Eliminating bound variables from formulas and deductions
William W. Tait.- Chapter 12. Intuitionism, the Paradox of Knowability and Empirical Negation
Gabriele Usberti.- Chapter 13. Explicit composition and its application in normalization proofs
Jan von Plato.- Chapter 14. A two-sorted typed lambda-calculus
Heinrich Wansing.- Chapter 15. Kreisel's second clause and the Theory of Constructions
Walter Dean & Hidenori Kurokawa.- Chapter 16. On Paradoxes in Proof-Theoretic Semantics
Yoshihiro Maruyama.

✦ Subjects


Semantica e logica;Conference publication


πŸ“œ SIMILAR VOLUMES


Advances in Proof-Theoretic Semantics
✍ Thomas Piecha, Peter Schroeder-Heister (eds.) πŸ“‚ Library πŸ“… 2016 πŸ› Springer 🌐 English

<p>This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and G

Advances in Proof-Theoretic Semantics
✍ Thomas Piecha, Peter Schroeder-Heister πŸ“‚ Library πŸ“… 2015 πŸ› Springer 🌐 English

--​Demonstrates the state of the art in proof-theoretic semantics --Discusses topics including semantics as a methodological question and general proof theory --Presents each chapter as a self-contained description of a significant research question in proof theoretic semantics This volume i

Advances in Proof-Theoretic Semantics
✍ Thomas Piecha, Peter Schroeder-Heister (eds.) πŸ“‚ Library πŸ“… 2016 πŸ› Springer International Publishing 🌐 English

<p><p>This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's an

Proof-theoretic Semantics
✍ Nissim Francez πŸ“‚ Library πŸ“… 2015 πŸ› College Publications 🌐 English

This book is a monograph on the topic of Proof-Theoretic Semantics, a theory of meaning constituting an alternative to the more traditional Model-Theoretic Semantics. The latter regards meaning as truth-conditions (in arbitrary models), the former regards meaning as canonical derivability conditions

Proof-theoretic Semantics
✍ Nissim Francez πŸ“‚ Library πŸ“… 2015 πŸ› College Publications 🌐 English

This book is a monograph on the topic of Proof-Theoretic Semantics, a theory of meaning constituting an alternative to the more traditional Model-Theoretic Semantics. The latter regards meaning as truth-conditions (in arbitrary models), the former regards meaning as canonical derivability conditions

What Logics Mean: From Proof Theory to M
✍ James W. Garson πŸ“‚ Library πŸ“… 2013 πŸ› Cambridge University Press 🌐 English

What do the rules of logic say about the meanings of the symbols they govern? In this book, James W. Garson examines the inferential behaviour of logical connectives (such as 'and', 'or', 'not' and 'if ... then'), whose behaviour is defined by strict rules, and proves definitive results concerning e