Results 1  10
of
8,326
Mechanising a Proof of Craig’s Interpolation Theorem for Intuitionistic Logic in Nominal Isabelle
 IN AISC/MKM/CALCULEMUS, VOLUME 5144 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2008
"... Craig’s Interpolation Theorem is an important metatheoretical result for several logics. Here we describe a formalisation of the result for firstorder intuitionistic logic without function symbols or equality, with the intention of giving insight into how other such results in proof theory might b ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Craig’s Interpolation Theorem is an important metatheoretical result for several logics. Here we describe a formalisation of the result for firstorder intuitionistic logic without function symbols or equality, with the intention of giving insight into how other such results in proof theory might
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
Craig’s interpolation theorem formalised and mechanised
 in Isabelle/HOL. Logic in Computer Science
, 2006
"... We formalise and mechanise a construtive, proof theoretic proof of Craig’s Interpolation Theorem in Isabelle/HOL. We give all the definitions and lemma statements both formally and informally. We also transcribe informally the formal proofs. We detail the main features of our mechanisation, such as ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We formalise and mechanise a construtive, proof theoretic proof of Craig’s Interpolation Theorem in Isabelle/HOL. We give all the definitions and lemma statements both formally and informally. We also transcribe informally the formal proofs. We detail the main features of our mechanisation
A Mechanised Proof of Gödel’s Incompleteness Theorems using Nominal Isabelle
"... Abstract A Isabelle/HOL formalisation of Gödel’s two incompleteness theorems is presented. Aspects of the development are described in detail, including two separate treatments of variable binding: the nominal package [25] and de Bruijn indices [3]. The work follows ´ Swierczkowski’s a detailed proo ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract A Isabelle/HOL formalisation of Gödel’s two incompleteness theorems is presented. Aspects of the development are described in detail, including two separate treatments of variable binding: the nominal package [25] and de Bruijn indices [3]. The work follows ´ Swierczkowski’s a detailed
Craig’s Interpolation Theorem formalised and mechanised in
"... We formalise and mechanise a construtive, proof theoretic proof of Craig’s Interpolation Theorem in Isabelle/HOL. We give all the definitions and lemma statements both formally and informally. We also transcribe informally the formal proofs. We detail the main features of our mechanisation, such as ..."
Abstract
 Add to MetaCart
We formalise and mechanise a construtive, proof theoretic proof of Craig’s Interpolation Theorem in Isabelle/HOL. We give all the definitions and lemma statements both formally and informally. We also transcribe informally the formal proofs. We detail the main features of our mechanisation
Strategies of Discourse Comprehension
, 1983
"... El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacke ..."
Abstract

Cited by 601 (27 self)
 Add to MetaCart
El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIA
Prosodic Morphology: constraint interaction and satisfaction
, 1993
"... Permission is hereby granted by the authors to reproduce this document, in whole or in part, for personal use, for instruction, or for any other noncommercial purpose. Table of Contents Acknowledgments......................................................... ..."
Abstract

Cited by 420 (31 self)
 Add to MetaCart
Permission is hereby granted by the authors to reproduce this document, in whole or in part, for personal use, for instruction, or for any other noncommercial purpose. Table of Contents Acknowledgments.........................................................
The ProofTheory and Semantics of Intuitionistic Modal Logic
, 1994
"... Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic definitions in the ordinary metatheory of informal classical mathematics. If, however, the same semantic definitions are interpret ..."
Abstract

Cited by 130 (0 self)
 Add to MetaCart
point of view, these systems are selfjustifying in that a possible world interpretation of the modalities can be read off directly from the inference rules. A technical justification is given by the faithfulness of translations into intuitionistic firstorder logic. It is also established that, in many
Results 1  10
of
8,326