Sciweavers

47 search results - page 2 / 10
» Finitary Partial Inductive Definitions as a General Logic
Sort
View
TYPES
2000
Springer
13 years 8 months ago
Executing Higher Order Logic
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
Stefan Berghofer, Tobias Nipkow
APAL
2010
90views more  APAL 2010»
13 years 5 months ago
Canonical extensions for congruential logics with the deduction theorem
We introduce a new and general notion of canonical extension for algebras in the algebraic counterpart AlgS of any finitary and congruential logic S. This definition is logic-base...
Mai Gehrke, Ramon Jansana, Alessandra Palmigiano
APAL
2006
94views more  APAL 2006»
13 years 5 months ago
Classifiable theories without finitary invariants
: It follows directly from Shelah's structure theory that if T is a classifiable theory, then the isomorphism type of any model of T is determined by the theory of that model ...
Elisabeth Bouscaren, Ehud Hrushovski
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 5 months ago
Cut Elimination for a Logic with Induction and Co-induction
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
Alwen Tiu, Alberto Momigliano
CADE
2010
Springer
13 years 6 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
Markus Aderhold