Related papers: Models of transfinite provability logic
This paper is a contribution to the study of the universal Horn fragment of predicate fuzzy logics, focusing on the proof of the existence of free models of theories of Horn clauses over Rational Pavelka predicate logic. We define the…
We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…
We say that a logic L has the Lyndon positivity property (LPP) if all formulas which are monotone in L (that is, are preserved under increasing the valuation on L-algebras) are L-equivalent to positive formulas (formulas without negation…
We investigate the complexity of satisfiability for finite-variable fragments of propositional dynamic logics. We consider three formalisms belonging to three representative complexity classes, broadly understood,---regular PDL, which is…
The lambda calculus is a universal programming language. It can represent the computable functions, and such offers a formal counterpart to the point of view of functions as rules. Terms represent functions and this allows for the…
In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…
In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…
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…
We present a canonical extension of topological dynamics to transfinite iterations, which makes precise the idea of dynamical phenomena stabilizing at different time-scales. Specifically, consider a sequence of self-maps $F=\{f_n\}$ of a…
A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While…
We establish the Lyndon interpolation property for basic lattice expansion logics (LE-logics) in arbitrary signatures using display calculi. Our approach is constructive, yielding interpolants algorithmically from derivations, and modular,…
We give an explicit construction of irreducible modules over Khovanov-Lauda-Rouquier algebras $R$ and their cyclotomic quotients $R^{\lambda}$ for finite classical types using a crystal basis theoretic approach. More precisely, for each…
The homology groups introduced by A. Brumer can be used to establish a criterion ensuring that a profinite $\mathbb{F}_p[[G]]$-module of a pro-$p$ group $G$ has projective dimension $d<\infty$ (cf. Thm. A). This criterion yields a new…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
Finitary/static semantics in the form of intersection type assignments have become a paradigm for analysing the fine structure of all sorts of lambda-models. The key step is the construction of a filter model isomorphic to a given…
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Elementary Affine Logic, LFPL (a language for polytime computation close to realistic functional programming introduced by…
We study the completeness problem for propositionally quantified modal logics on quantifiable general frames, where the admissible sets are the propositions the quantifiers can range over and expressible sets of worlds are admissible, and…
We study feebly compact shift-continous topologies on the semilattice $\left(\exp_n\lambda,\cap\right)$. It is proved that such $T_1$-topology is sequentially pracompact if and only if it is $\mathfrak{D}(\omega)$-compact.
Logical reasoning remains a challenge for natural language processing, but it can be improved by training language models to mimic theorem provers on procedurally generated problems. Previous work used domain-specific proof generation…
It is well-known that simple type theory is complete with respect to non-standard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed…