Abstract: As is already known from the work of D. Janin & I. Walukiewicz (1996), the mu-calculus is as expressive as the bisimulation-invariant fragment of monadic second-order logic. In this paper, ...

Abstract: We study the problem of determining a concise, quantifier-free monadic predicate for a given set of objects in a given interpretation. We address both DNF and CNF predicates, as well as ...

We present a new, completely redesigned, version of F*, a language that works both as a proof assistant as well as a general-purpose, verification-oriented, effectful programming language. In support ...

The study of monadic algebraic structures and fuzzy logic has evolved into a vibrant research area that bridges abstract algebra with the nuanced reasoning of uncertainty. By incorporating unary ...

In this paper, we introduce the notion of similarity monadic MTL-algebras and study some of their related basic algebraic properties. Then we introduce and investigate similarity monadic filters of ...

Formation rules Induction on formula complexity Semantic methods: Truth tables, partial truth tables, trees Reading: Lemmon pp 41-49, 64-74 Validity in virtue of quantifier structure Elementary ...

From first-order monadic predicate calculus to polyadic predicate calculus with identity. Symbolization, rules of inference, derivation and refutation of arguments. Introduction to modal logics.