English
Related papers

Related papers: Models of transfinite provability logic

200 papers

We give a type system in which the universe of types is closed by reflection into it of the logical relation defined externally by induction on the structure of types. This contribution is placed in the context of the search for a natural,…

Logic in Computer Science · Computer Science 2015-02-23 Andrew Polonsky

In a modular approach, we lift Hilbert-style proof systems for propositional, modal and first-order logic to generalized systems for their respective team-based extensions. We obtain sound and complete axiomatizations for the…

Logic in Computer Science · Computer Science 2018-03-28 Martin Lück

We give a direct proof of the local $Tb$ Theorem, in the Euclidean setting, and under the assumption of dual exponents. This Theorem provides a flexible framework for proving the boundedness of a Calder\'on-Zygmund operator, supposing the…

Classical Analysis and ODEs · Mathematics 2016-05-03 Michael T. Lacey , Antti V. Vähäkangas

We study the positive logic FO+ on finite words, and its fragments, pursuing and refining the work initiated in [Kuperberg 2023]. First, we transpose notorious logic equivalences into positive first-order logic: FO+ is equivalent to LTL+ ,…

Logic in Computer Science · Computer Science 2024-06-26 Denis Kuperberg , Quentin Moreau

Let $\Gamma$ and $\Lambda$ be artin algebras such that $\Gamma$ is a split-by-nilpotent extension of $\Lambda$ by a two sided ideal $I$ of $\Gamma.$ Consider the so-called change of rings functors $G:={}_\Gamma\Gamma_\Lambda\otimes_\Lambda…

Representation Theory · Mathematics 2013-04-22 Marcelo Lanzilotta , Octavio Mendoza , Corina Sáenz

This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many…

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

The importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of view, intuitionistic temporal logics have made it possible…

Logic in Computer Science · Computer Science 2023-06-22 Joseph Boudou , Martín Diéguez , David Fernández-Duque , Philip Kremer

This paper has three parts. First, we study and characterize amenable and extremely amenable topological semigroups in terms of invariant measures using integral logic. We prove definability of some properties of a topological semigroup…

Logic · Mathematics 2016-07-12 Karim Khanaki

Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over modal indices, so that we can have formulas of the form $\exists y. \forall x. (\Box_x P(x,y) \supset\Diamond_y P(y,x))$. Like First order…

Logic in Computer Science · Computer Science 2019-06-28 Anantha Padmanabha , R. Ramanujam

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

Logic · Mathematics 2013-04-15 Vera Koponen

We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…

Logic in Computer Science · Computer Science 2024-12-02 Daumantas Kojelis

Deconstructibility is an often-used sufficient condition on a class $\mathcal{C}$ of modules that allows one to carry out homological algebra \emph{relative to $\mathcal{C}$}. The principle \textbf{Maximum Deconstructibility (MD)} asserts…

Logic · Mathematics 2025-05-23 Sean Cox

A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…

Logic in Computer Science · Computer Science 2024-02-09 Vincent Moreau , Lê Thành Dũng Nguyên

Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field. We exhibit slices of the representation theory of $\Lambda$ that are always classifiable in stringent geometric terms. Namely, we prove that, for any…

Representation Theory · Mathematics 2014-07-11 H. Derksen , B. Huisgen-Zimmermann , J. Weyman

We study the finite model property of subframe logics with expressible transitive reflexive closure modality. For $m>0$, let $\mathrm{L}_m$ be the logic defined by axiom $\lozenge^{m+1} p\to \lozenge p\vee p$. We construct filtrations for…

Logic · Mathematics 2025-06-16 Andrey Kudinov , Ilya Shapirovsky

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…

Logic · Mathematics 2012-02-28 Saharon Shelah

The condition of nilpotency is studied in the general linear Lie algebra $\mathfrak{gl}_{n}(\mathbb{K})$ and the symplectic Lie algebra $\mathfrak{sp}_{2m}(\mathbb{K})$ over an algebraically closed field of characteristic 0. In particular,…

Algebraic Geometry · Mathematics 2014-03-14 Samuel Reid

We present basic notions of Gold's "learnability in the limit" paradigm, first presented in 1967, a formalization of the cognitive process by which a native speaker gets to grasp the underlying grammar of his/her own native language by…

Machine Learning · Computer Science 2009-09-29 Roberto Bonato

An appropriate framework is put forward for the construction of $\lambda$-models with $\infty$-groupoid structure, which we call \textit{homotopic $\lambda$-models}, through the use of an $\infty$-category with cartesian closure and enough…

Logic in Computer Science · Computer Science 2022-10-27 Daniel O. Martínez-Rivillas , Ruy J. G. B. de Queiroz