## Abstract In this paper we propose a new set of rules for a judgement calculus, i.e. a typed lambda calculus, based on Intuitionistic Linear Logic; these rules ease the problem of defining a suitable mathematical semantics. A proof of the canonical form theorem for this new system is given: it as
β¦ LIBER β¦
Fresh Logic: proof-theory and semantics for FM and nominal techniques
β Scribed by Murdoch J. Gabbay
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 454 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1570-8683
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the FM-sets model of names and binding in abstract syntax. Fresh Logic can be classical or intuitionistic depending on whether we include a law of excluded middle; we present a proof-normalisation procedure for the intuitionistic case and a semantics based on Kripke models in FM-sets for which it is sound and complete.
π SIMILAR VOLUMES
THE JUDGEMENT CALCULUS FOR INTUITIONISTI
β
Silvio Valentini
π
Article
π
1992
π
John Wiley and Sons
π
English
β 958 KB
A uniform semantic proof for cut-elimina
β
Mitsuhiro Okada
π
Article
π
2002
π
Elsevier Science
π
English
β 201 KB
Sextet polynomial. A new enumeration and
β
Haruo Hosoya; TamiΓ« Yamaguchi
π
Article
π
1975
π
Elsevier Science
π
French
β 216 KB
Formal semantics and proof techniques fo
π
Article
π
1999
π
Elsevier Science
π
English
β 86 KB