6,186 research outputs found
A general conservative extension theorem in process algebras with inequalities
We prove a general conservative extension theorem for transition system based process theories with easy-to-check and reasonable conditions. The core of this result is another general theorem which gives sufficient conditions for a system of operational rules and an extension of it in order to ensure conservativity, that is, provable transitions from an original term in the extension are the same as in the original system. As a simple corollary of the conservative extension theorem we prove a completeness theorem. We also prove a general theorem giving sufficient conditions to reduce the question of ground confluence modulo some equations for a large term rewriting system associated with an equational process theory to a small term rewriting system under the condition that the large system is a conservative extension of the small one. We provide many applications to show that our results are useful. The applications include (but are not limited to) various real and discrete time settings in ACP, ATP, and CCS and the notions projection, renaming, stage operator, priority, recursion, the silent step, autonomous actions, the empty process, divergence, etc
Recommended from our members
Automated verification of refinement laws
Demonic refinement algebras are variants of Kleene algebras. Introduced by von Wright as a light-weight variant of the refinement calculus, their intended semantics are positively disjunctive predicate transformers, and their calculus is entirely within first-order equational logic. So, for the first time, off-the-shelf automated theorem proving (ATP) becomes available for refinement proofs. We used ATP to verify a toolkit of basic refinement laws. Based on this toolkit, we then verified two classical complex refinement laws for action systems by ATP: a data refinement law and Back's atomicity refinement law. We also present a refinement law for infinite loops that has been discovered through automated analysis. Our proof experiments not only demonstrate that refinement can effectively be automated, they also compare eleven different ATP systems and suggest that program verification with variants of Kleene algebras yields interesting theorem proving benchmarks. Finally, we apply hypothesis learning techniques that seem indispensable for automating more complex proofs
Doing and Showing
The persisting gap between the formal and the informal mathematics is due to
an inadequate notion of mathematical theory behind the current formalization
techniques. I mean the (informal) notion of axiomatic theory according to which
a mathematical theory consists of a set of axioms and further theorems deduced
from these axioms according to certain rules of logical inference. Thus the
usual notion of axiomatic method is inadequate and needs a replacement.Comment: 54 pages, 2 figure
Symbols and the bifurcation between procedural and conceptual thinking
Symbols occupy a pivotal position between processes to be carried out and concepts to be thought about. They allow us both to d o mathematical problems and to think about mathematical relationships.
In this presentation we consider the discontinuities that occur in the learning path taken by different students, leading to a divergence between conceptual and procedural thinking. Evidence will be given from several different contexts in the development of symbols through
arithmetic, algebra and calculus, then on to the formalism of axiomatic mathematics. This is taken from a number of research studies recently performed for doctoral dissertations at the University of Warwick by students from the USA, Malaysia, Cyprus and Brazil, with data collected
in the USA, Malaysia and the United Kingdom. All the studies form part of a broad investigation into why some students succeed yet others fail
A Labelled Analytic Theorem Proving Environment for Categorial Grammar
We present a system for the investigation of computational properties of
categorial grammar parsing based on a labelled analytic tableaux theorem
prover. This proof method allows us to take a modular approach, in which the
basic grammar can be kept constant, while a range of categorial calculi can be
captured by assigning different properties to the labelling algebra. The
theorem proving strategy is particularly well suited to the treatment of
categorial grammar, because it allows us to distribute the computational cost
between the algorithm which deals with the grammatical types and the algebraic
checker which constrains the derivation.Comment: 11 pages, LaTeX2e, uses examples.sty and a4wide.st
- …