This article proposes that predicate order and coherence relations are the two major determining factors in copredication licensing, resolving a long-standing puzzle over criteria for constructing acceptable copredications. The effects of ordering claimed to be anchored around semantic complexity, such copredications with semantically Simple–Complex orderings more than reverse. motivates parsin...

Abstract We present a semantic framework for the deductive verification of hybrid systems with Isabelle/HOL. It supports reasoning about temporal evolutions programs in style differential dynamic logic modelled by flows or invariant sets vector fields. introduce foundations this and summarise their Isabelle formalisation as well resulting components. A series simple examples shows our approach ...

This paper presents a novel machine learning technique in a logic programming environment: Inductive Prediction by Analogy (IPA). IPA learns the description a target predicate similar to a source predicate from examples of the target predicate. Akey feature of IPAis that it uses analogies to constrain the space of hypotheses using taxonomic information represented by first-order predicate logic...

SatAbs is a bit-precise software model checker for ANSI-C programs. It implements sound predicate-abstraction based algorithms for both sequential and concurrent software. 1 Verification Approach SatAbs [7] is a verifier for C programs that uses counterexample-guided abstraction refinement [8] (Fig. 1), based on predicate abstraction [12], as pioneered by SLAM [2]. By interpreting variables of ...

In this paper we take up the study of Henkin quantifiers with boolean variables [4] also known as partially ordered connectives [19]. We consider first-order formulae prefixed by partially ordered connectives, denoted D, on finite structures. We characterize D as a fragment of second-order existential logic Σ 1♥ whose formulae do not allow for existential variables being argument of predicate v...

Flagg and Friedman [2] introduced a translation (·) Γ from EPC (epistemic first–order predicate calculus with equality, i.e. classical first–order predicate calculus based on Lewis’s modal calculus S4 with equality) to IPC (intuitionistic first–order predicate calculus with equality). In the same paper, by making use of the soundness of the translation, they gave in a uniform way an alternative...

We describe and compare design choices for meta-predicate semantics, as found in representative Prolog module systems and in Logtalk. We look at the consequences of these design choices from a pragmatic perspective, discussing explicit qualification semantics, computational reflection support, expressiveness of meta-predicate declarations, safety of meta-predicate definitions, portability of me...

It is well-known that there exist consistent first-order theories that become inconsistent when we add Tarski’s schema T. This is Tarski’s Theorem. To avoid the inconsistency result, one can restrict Tarski’s schema in different ways. In our paper we restrict Tarski’s schema T by only instantiating the schema with a proper subset of the set of all sentences. We prove several results concerning ...

Let V be a set of number-theoretical functions. We define notion absolute -realizability for predicate formulas and sequents in such way that the indices functions are used interpreting implication universal quantifier. In this article, we prove Basic Predicate Calculus is sound with respect to semantics if satisfies some natural conditions.