-
The modal mu-calculus is a very expressive formalism extending basic modal logic with least and greatest fixpoint operators. In the seminal paper introducing the formalism in the shape known today, Dexter Kozen also proposed an elegant axiom system, and he proved a partial completeness result wit...
-
The modal mu-calculus is a very expressive formalism extending basic modal logic with least and greatest fixpoint operators. In the seminal paper introducing the formalism in the shape known today, Dexter Kozen also proposed an elegant axiom system, and he proved a partial completeness result wit...
-
Combinatorial auctions are mechanisms for allocating bundles of goods to agents who each have preferences over these goods. Finding an economically efficient allocation, the so-called winner determination problem, is computationally intractable in the general case, which is why it is important t...
-
Distributed mechanisms for allocating indivisible goods are mechanisms lacking central control, in which agents can locally agree on deals to exchange some of the goods in their possession. We study convergence properties for such distributed mechanisms when used as fair division procedures. Spec...
-
With each superinuitionistic logic (si-logic), we associate its downward and upward subframizations, and characterize them by means of Zakharsyachev's canonical formulas, as well as by embedding si-logics into the extensions of the propositional lax logic. In an analogous fashion, with each si-lo...
-
We introduce the concept of a Zemanian logic above S4.3 and prove that an extension of S4.3 is the logic of a Tychonoff HED-space iff it is Zemanian.
-
We expand on recent work extending the semantic automata model of quantifier verification to iteration. We demonstrate a simple and
intuitive method to construct a minimal iteration DFA from two DFA recognizing monadic regular quantifier languages and prove that deterministic CFL are also closed...
-
This paper contributes to the theory of the modal $\mu$-calculus by proving some model-theoretic results. More in particular, we discuss a number of semantic properties pertaining to formulas of the modal $\mu$-calculus. For each of these properties we provide a corresponding syntactic fragment, ...
-
This is an editorial for a special issue of the Chinese journal "Studies in Logic" on current research at the interface of logic and games.
-
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference...
-
Brouwer’s intuitionism is characterized by sequences not completely determined by a law: choice sequences. Initially Brouwer used only global properties of choice sequences, as in his reaching the continuum from the discrete. But in the late nineteen twenties he found a way to apply particular c...