A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing

DOI10.1007/978-3-642-17511-4_14zbMath1253.03058OpenAlexW1589736618MaRDI QIDQ3066102

Michael Gabbay, Murdoch James Gabbay

Publication date: 7 January 2011

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17511-4_14

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (3)

A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language ⋮ Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness ⋮ A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets

This page was built for publication: A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing