Related papers: Structural completeness in many-valued logics with…
We study structural limitations of purely algebraic reasoning in the analysis of arithmetic dynamical systems. Rather than addressing the truth of specific conjectures, we introduce a fragment - relative notion of algebraic refutability for…
The category of quasi frames (or qframes) is introduced and studied. In the context of qframes we can jointly study problems related to the L-Surjunctivity and Stable Finiteness Conjectures. As a consequences of our main results, we can…
The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…
We consider an extension of linear-time temporal logic (LTL) with both local and remote data constraints interpreted over a concrete domain. This extension is a natural extension of constraint LTL and the Temporal Logic of Repeating Values,…
This paper introduces robust differential dynamic logic (a fragment of differential dynamic logic) to specify and reason about robust hybrid systems. Practically meaningful syntactic restrictions naturally ensure that definable properties…
We survey the logical structure of constructive set theories and point towards directions for future research. Moreover, we analyse the consequences of being extensible for the logical structure of a given constructive set theory. We…
We introduce a relational semantics based on poset products, and provide sufficient conditions guaranteeing its soundness and completeness for various substructural logics. We also demonstrate that our relational semantics unifies and…
In this paper we study a notion of HL-extension (HL standing for Herwig--Lascar) for a structure in a finite relational language $\mathcal{L}$. We give a description of all finite minimal HL-extensions of a given finite…
The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…
For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…
An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…
Hyper-Positive Real, matrix-valued, rational functions are associated with absolute stability (the Lurie problem). Here, quantitative subsets of Hyper-positive functions, related through nested inclusions, are introduced. Structurally, this…
We investigate different set-theoretic constructions in Residuated Logic based on Fitting's work on Intuitionistic Set Theory. We start by stating some results concerning constructible sets within valued models of Set Theory. We present two…
In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occurs-check) and increased expressivity (cyclic terms can…
Logic-based argumentation is a well-established formalism modelling nonmonotonic reasoning. It has been playing a major role in AI for decades, now. Informally, a set of formulas is the support for a given claim if it is consistent,…
We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…
We consider properties of extensions of Krull domains such as flatness that involve behavior of extensions and contractions of prime ideals. Let (R,m) be an excellent normal local domain with field of fractions K, let y be a nonzero element…
We obtain modal completeness of the interpretability logics ILP_0 and ILR w.r.t. generalized Veltman semantics. Our proofs are based on the notion of smart (full) labels. We also give shorter proofs of completeness w.r.t. generalized…