How to Universally Close the Existential Rule
نویسنده
چکیده
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice consequence of this is that proofs of sentences cannot contain free variables. Another nice consequence is that the assumption of a non-empty domain is isolated in a single inference rule. This rule can be removed or added at will, leading to a system for free logic or classical predicate logic, respectively. The system for free logic is interesting because it has no need for an existence predicate. We see syntactic cut-elimination and completeness results for these two systems as well as two standard applications: Herbrand’s Theorem and interpolation.
منابع مشابه
Completely Monotone Sequences and Universally Prestarlike Functions
We introduce universally convex, starlike and prestarlike functions in the slit domain C \ [1,∞), and show that there exists a very close link to completely monotone sequences and Pick functions.
متن کاملAmalgamating NAF and NAI
We deene a new logic language with negation by introducing existential and universal quantiiers in the queries. We call ??general programs and ??general goals the programs and the goals in this language. Negation is handled by using two rules: the NAF rule for universally quantiied negative queries and the NAI rule for existentially quantiied negative queries. We formalize this amalgamation in ...
متن کاملArbitrary Reference
Two fundamental rules of reasoning are Universal Generalisation (UG) and Existential Instantiation (EI). The former is the rule that allows us, given that we stipulate that ABC is an arbitrary triangle and prove that ABC has a property p, to conclude that all triangles have p. The latter is the rule that allows us, given that there exists a continuous function, to stipulate that f is an (arbitr...
متن کاملExistential quantifiers in the rule body
In this paper we consider a simple syntactic extension of Answer Set Programming (ASP) for dealing with (nested) existential quantifiers and double negation in the rule bodies, in a close way to the recent proposal RASPL-1. The semantics for this extension just resorts to Equilibrium Logic (or, equivalently, to the General Theory of Stable Models), which provides a logic-programming interpretat...
متن کاملNested Quantification in Graph Transformation Rules
In this paper we describe a way to integrate Taentzer’s rule amalgamation with the recently proposed notions of nested graph conditions. The resulting so-called quantified graph transformation rules include (universally and existentially) quantified sub-structures in a flexible way. This can be used for instance to specify a larger-step operational semantics, thus improving the scalability of g...
متن کامل