. The objects of the model were equivalence classes of terms, and the interpretations of constant symbols, function symbols, and predicate symbols were all defined from syntactic information. However, ...

Predicate logic is an extension of propositional logic. Here we consider what is called first-order predicate logic, abbreviated FOL (sometimes abbreviated PL1, not to be confused with the programming ...

HyPA is a tool that can verify hyperproperties on infinite-state systems. It specializes on \forall^k\exists^l-safety hyperproperties (for some k, l) which state that for all k traces there exist l ...

Quantification is one of the central topics in language and computation, and the interplay of collectivity, distributivity, cumulativity, and plurality is at the heart of the semantics of ...

Theoretical linguistics postulates abstract structures that successfully explain key aspects of language. However, the precise relation between abstract theoretical ideas and empirical data from ...

ABSTRACT: This paper is divided into three parts. In the first part, we review the historical background of a system of logic devised by Henry S. Leonard to allow for reasoning using existence as a ...

The recent discussion about the consistency of arithmetic made me want to brush up on my logic. I’d like to learn a bit about axioms for arithmetic that are weaker than Peano arithmetic. The most ...