Related papers: Well-orders in the transfinite Japaridze algebra I…
This paper studies the transfinite propositional provability logics $\glp_\Lambda$ and their corresponding algebras. These logics have for each ordinal $\xi< \Lambda$ a modality $\la \alpha \ra$. We will focus on the closed fragment of…
We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.
By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…
A logic formalism is presented which increases the expressive power of the ID/LP format of GPSG by enlarging the inventory of ordering relations and extending the domain of their application to non-siblings. This allows a concise, modular…
In this paper, we study the well extension of strict(irreflective) partial well orderings. We first prove that any partially well-ordered structure <A, R> can be extended to a well-ordered one. Then we prove that every linear extension of…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…
We consider a many-sorted variant of Japaridze's polymodal provability logic $\mathsf{GLP}$. In this variant, which is denoted $\mathsf{GLP}^\ast$, propositional variables are assigned sorts $\alpha \leq \omega$, where variables of finite…
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…
Provability logics are modal or polymodal systems designed for modeling the behavior of G\"odel's provability predicate in arithmetical theories and its natural extensions. If \Lambda is any ordinal, the G\"odel-L\"ob calculus GLP(\Lambda)…
We examine cyclic, non-well-founded and well-founded derivations in the provability logic $\mathsf{GLP}$. While allowing cyclic derivations does not change the system, the non-well-founded and well-founded derivations we consider define the…
A decidable transfinite hierarchy is defined by assigning ordinals to the programs of an imperative language. It singles out: the classes TIMEF(n^c) and TIMEF(n_c); the finite Grzegorczyk classes at and above the elementary level, and the…
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
The set of finite words over a well-quasi-ordered set is itself well-quasi-ordered. This seminal result by Higman is a cornerstone of the theory of well-quasi-orderings and has found numerous applications in computer science. However, this…
Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…
Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…
Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…
We show that the spaces of transfinite words, namely ordinal-indexed words, over a Noetherian space, is also Noetherian, under a natural topology which we call the regular subword topology. We characterize its sobrification and its…
We consider entailment problems involving powerful constraint languages such as guarded existential rules, in which additional semantic restrictions are put on a set of distinguished relations. We consider restricting a relation to be…