Related papers: Capturing k-ary Existential Second Order Logic wit…
PIE is a Prolog-embedded environment for automated reasoning on the basis of first-order logic. It includes a versatile formula macro system and supports the creation of documents that intersperse macro definitions, reasoner invocations and…
Existential rules are an expressive knowledge representation language mainly developed to query data. In the literature, they are often supposed to be in some normal form that simplifies technical developments. For instance, a common…
An analytical formula is developed to represent accurately the photoabsorption cross section of O I for all energies of interest in X-ray spectral modeling. In the vicinity of the Kedge, a Rydberg series expression is used to fit R-matrix…
Second-order quantifier elimination is the problem of finding, given a formula with second-order quantifiers, a logically equivalent first-order formula. While such formulas are not computable in general, there are practical algorithms and…
We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…
Intuitionistic dependence logic was introduced by Abramsky and Vaananen (2009) as a variant of dependence logic under a general construction of Hodges' (trump) team semantics. It was proven that there is a translation from intuitionistic…
We address questions of logic and expressibility in the context of random rooted trees. Infiniteness of a rooted tree is not expressible as a first order sentence, but is expressible as an existential monadic second order sentence (EMSO).…
We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…
Intuitionistic first-order logic extended with a restricted form of Markov's principle is constructive and admits a Curry-Howard correspondence, as shown by Herbelin. We provide a simpler proof of that result and then we study…
We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes ${\Sigma}_i$ (sentences having at most $i$ blocks of quantifiers starting with an $\exists$) and…
An expression $E(X_{1},...,X_{n})$ built using union, intersection, and complements is called inclusion-exclusion-like if, like the union in the exclusion-inclusion principle, there are constants $c_{1},c_{2},...,c_{n}$ so that for any…
The use of Extended Logics to replace ordinary second order definability in Kleene's {\em Ramified Analytical Hierarchy} is investigated. This mirrors a similar investigation of Kennedy, Magidor and V\"a\"an\"anen \cite{KeMaVa2016} where…
Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…
Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL, LLL or SLL, by including variants of the exponential rules.…
I give an introduction to algorithmic uses of the principle of inclusion-exclusion. The presentation is intended to be be concrete and accessible, at the expense of generality and comprehensiveness.
In this paper we present an alternative approach to formalize the theory of logic programming. In this formalization we allow existential quantified variables and equations in queries. In opposite to standard approaches the role of answer…
This paper explores the relationship between convexity and sum sets. In particular, we show that elementary number theoretical methods, principally the application of a squeezing principle, can be augmented with the Elekes-Szab\'{o} Theorem…
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…
This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier $I$. $I$ forms a formula from two…
In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…