JSTOR Daily

First Order Quantifiers in Monadic Second Order Logic

This is a preview. Log in through your library . Abstract This paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order logic, extending the ...
IEEE

Equivalence and quantifier rules for logic with imperfect information

Abstract: In this paper, we present a prenex form theorem for a version of Independence Friendly logic, a logic with imperfect information. Lifting classical results to such logics turns out not to be ...
JSTOR Daily

The Hierarchy Theorem for Second Order Generalized Quantifiers

We study definability of second order generalized quantifiers on finite structures. Our main result says that for every second order type t there exists a second order generalized quantifier of type t ...
University of Vermont

Predicate logic

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 ...
IEEE

Approximate formulae for a logic that capture classes of computational complexity

Abstract: This paper presents a syntax of approximate formulae suited for the logic with counting quantifiers 픖햪ℒ풫. This logic was formalised by us in [1] where, among other properties, we showed the ...
Nature

Logic and Geometric Representations

Logic and geometric representations constitute an interdisciplinary framework that merges formal logical systems with spatial and diagrammatic structures. This field encompasses the study of classical ...
University of East Anglia

Ranks in positive logic (KIRBYJ2_U26EMP)

Model theory is traditionally done with “classical first-order logic”, the logic which allows unlimited use of the operators AND, OR, NOT, with the EXISTS and FOR ALL quantifiers. More recently, ...