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 compiled into a functional program. Functions and inductively defined relations can be mixed. Inductive definitions must be such that they can be executed in Prolog style but requiring only matching rather than unificat...

We provide an extension of universal algebra and its equational logic from first to second order. Conservative extension, soundness, and completeness results are established.

In this paper we define computationally well-behaved versions of classical first-order logic and prove that the validity problem is decidable1.

We consider the EFO fragment of simple type theory, which restricts quantification and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: complete proof systems, compactness, and countable models. We obtain these results with an analytic tableau system and a concomitant model ex...

This paper represents the third step in the development of EQ-logics. Namely, after developing propositional and higher-order EQ-logics, we focus also on predicate one. First, we give a brief overview of the propositional EQ-logic and then develop syntax and semantics of predicate EQ-logic. Finally, we prove completeness by constructing a model of a consistent theory of EQ-logic from the syntac...

The last chapter presented the general concept of a logic. In this chapter we consider a particular logic | rst order predicate calculus, also known as simply rst order logic. First order logic is by far the most widely studied logic. It was rst formulated by Guttlob Frege in 1879. However, the fundamental semantic properties of rst order logic were not really understood until the work of Skole...

We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}ψ]φ expressing that the coalition of all agents satisfying ψ(x) can achieve a state in which φ holds. We use neighborhood semantics to model extensive games of perfect information with simultaneous actions and we provide a framework reasoning about agents in the same way as it is rea...

This paper shows the use of partial-order assertions and lattice domains for logic programming. We illustrate the paradigm using a variety of examples, ranging from program analysis to deductive databases. These applications are characterized by a need to solve circular constraints and perform aggregate operations. We show in this paper that deening functions with subset assertions and, more ge...