منابع مشابه
Classical Propositional Decidability via Nuprl Proof Extraction
This paper highlights a methodology of Nuprl proof that re sults in e cient programs that are more readable than those produced by other established methods for extracting programs from proofs We de scribe a formal constructive proof of the decidability of a sequent calculus for classical propositional logic The proof is implemented in the Nuprl system and the resulting proof object yields a co...
متن کاملModularity of Confluence: A Simplified Proof
In this note we present a simple proof of a result of Toyama which states that the disjoint union of confluent term rewriting systems is confluent. 1985 Mathematics Subject Classification: 68Q5
متن کاملA Simplified Proof of Moufang’s Theorem
Moufang’s theorem states that if Q is a Moufang loop with elements x, y and z such that x ·yz = xy · z, then these three elements generate a subgroup of Q. The paper contains a new proof of this theorem that is shorter and more transparent than the standardly used proof of Bruck. A loop is a binary structure with a unit such that the equations ax = b and ya = b have unique solutions x = a\b and...
متن کاملA purely syntactic proof of decidability for BI
The logic of bunched implication BI provides a framework for reasoning about resource composition and forms the basis for an assertion language of separation logic which is used to reason about software programs. Propositional BI is obtained by freely combining propositional intuitionistic logic and multiplicative intuitionistic linear logic. It possesses an elegant proof theory: its bunched ca...
متن کاملA new proof for the decidability of D0L ultimate periodicity
L systems were originally introduced by A. Lindenmayer to model the development of simple filamentous organisms [6, 7]. The challenging and fruitful study of these systems in the 70s and 80s created many new results and notions [9]. In this paper we consider the important problem of recognizing ultimately periodic D0L sequences. Let A be a finite alphabet and denote the empty word by ε . A D0L ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00027-0