Related papers: The Common Knowledge of Formula Exclusion
Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…
Let $f$ be a transcendental entire function and let $A(f)$ denote the set of points that escape to infinity `as fast as possible' under iteration. By writing $A(f)$ as a countable union of closed sets, called `levels' of $A(f)$, we obtain a…
Argumentation frameworks, consisting of arguments and an attack relation representing conflicts, are fundamental for formally studying reasoning under conflicting information. We use methods from mathematical logic, specifically…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
We study how linear orders can be employed to realise choice functions for which the set of potential choices is restricted, i.e., the possible choice is not possible among the full powerset of all alternatives. In such restricted settings,…
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…
Let $(c_k)_{k\in \mathbb{N}}$ be a sequence of positive integers. We investigate the set of $A>1$ such that the integer part of $A^{c_1\cdots c_k}$ is always a prime number for every positive integer $k$. Let $\mathcal{W}(c_k)$ be this set.…
We can look at a first-order (or propositional) intuitionistic Kripke model as an ordered set of classical models. In this paper, we show that for a finite-depth Kripke model in an arbitrary first-order language or propositional language,…
The Perfectly Transparent Equilibrium is algorithmically defined, for any game in normal form with perfect information and no ties, as the iterated deletion of non-individually-rational strategy profiles until at most one remains. In this…
The usual semantics of multi-agent epistemic logic is based on Kripke models, defined in terms of binary relations on a set of possible worlds. Recently, there has been a growing interest in using simplicial complexes rather than graphs, as…
Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in…
We find new "reasons" for a class of models for not having a universal model in a cardinal $\lambda$. This work, though it has consequences in model theory, is really in combinatorial set theory. We concentrate on a prototypical class which…
Formulae of the Lambek calculus are constructed using three binary connectives, multiplication and two divisions. We extend it using a unary connective, positive Kleene iteration. For this new operation, following its natural…
We introduce FIK, a natural intuitionistic modal logic specified by Kripke models satisfying the condition of forward confluence. We give a complete Hilbert-style axiomatization of this logic and propose a bi-nested calculus for it. The…
The Frankl's conjecture, formulated in 1979. and still open, states that in every family of sets closed for unions there is an element contained in at least half of the sets. A family Fc is called Frankl-complete (or FC-family) if in every…
Glivenko's theorem states that a formula is derivable in classical propositional logic $\mathrm{CL}$ iff under the double negation it is derivable in intuitionistic propositional logic $\mathrm{IL}$: $\mathrm{CL}\vdash\varphi$ iff…
The critical exponent of an infinite word is defined to be the supremum of the exponent of each of its factors. For k-automatic sequences, we show that this critical exponent is always either a rational number or infinite, and its value is…
We write arbitrary separable nuclear C*-algebras as limits of inductive systems of finite-dimensional C*-algebras with completely positive connecting maps. The characteristic feature of such CPC*-systems is that the maps become more and…
We show that for the standard map family, for all values of the parameter, except one, the mapping has positive topological entropy. The main tool is the following result. Let $S$ be a compact connected orientable surface and $f:S…
We define a class of formal systems inspired by Prawitz's theory of grounds. The latter is a semantics that aims at accounting for epistemic grounding, namely, at explaining why and how deductively valid inferences have the power to…