Related papers: On provability logics with linearly ordered modali…

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

We introduce two extensions of the $\lambda$-calculus with a probabilistic choice operator, $\Lambda_\oplus^{cbv}$ and $\Lambda_\oplus^{cbn}$, modeling respectively call-by-value and call-by-name probabilistic computation. We prove that…

A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

This paper introduces a new machine architecture for evaluating lambda expressions using the normal-order reduction, which guarantees that every lambda expression will be evaluated if the expression has its normal form and the system has…

We present a logic named L_{LF} whose intended use is to formalize properties of specifications developed in the dependently typed lambda calculus LF. The logic is parameterized by the LF signature that constitutes the specification. Atomic…

Generalization of the Lambalgen's theorem is studied with the notion of Hippocratic (blind) randomness without assuming computability of conditional probabilities. In [Bauwence 2014], a counter-example for the generalization of Lambalgen's…

We study a many-valued generalization of Propositional Dynamic Logic where formulas in states and accessibility relations between states of a Kripke model are evaluated in a finite FL-algebra. One natural interpretation of this framework is…

Glivenko's theorem says that, in propositional logic, classical provability of a formula entails intuitionistic provability of double negation of that formula. We generalise Glivenko's theorem from double negation to an arbitrary nucleus,…

For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

The probabilistic method is a technique for proving combinatorial existence results by means of showing that a randomly chosen object has the desired properties with positive probability. A particularly powerful probabilistic tool is the…

In this paper, we consider a two-parameter ($l$ and $a$) generalization of a sequence that Glasby and Paseman considered. Based on computer experiments, we conjecture its unimodality, log-concavity, peak positions, and the asymptotic…

We show that if $\lambda^{<\kappa} = \lambda$ and every normal filter on $P_\kappa\lambda$ can be extended to a $\kappa$-complete ultrafilter then so does every $\kappa$-complete filter on $\lambda$. This answers a question of Gitik.

Let $X_1, X_2,\ldots, X_n$ (resp. $Y_1, Y_2,\ldots, Y_n$) be independent random variables such that $X_i$ (resp. $Y_i$) follows generalized exponential distribution with shape parameter $\theta_i$ and scale parameter $\lambda_i$ (resp.…

Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of…

Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing alternatives with decreasing degrees of preference in the heads of program rules. Despite the fact that the operational…

We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish…

Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…

We study extensions of standard description logics to the framework of polyadic modal logic. We promote a natural approach to such logics via general relation algebras that can be used to define operations on relations of all arities. As a…