English
Related papers

Related papers: Continuous first order logic and local stability

200 papers

We study the expressive power of First-Order Logic (\FO) over (unordered) infinite trees, with the aim of identifying robust characterisations in terms of branching-time specification formalisms. While such correspondences are well…

Logic in Computer Science · Computer Science 2026-04-30 Massimo Benerecetti , Dario Della Monica , Angelo Matteo , Fabio Mogavero , Gabriele Puppis

We prove a motivic stabilization result for the cohomology of the local systems on configuration spaces of varieties over $\mathbb{C}$ attached to character polynomials. Our approach interprets the stabilization as a probabilistic…

Algebraic Geometry · Mathematics 2020-12-16 Sean Howe

This paper involves generalizing the Goldblatt-Thomason and the Lindstr\"om characterization theorems to first-order modal logic.

Logic · Mathematics 2016-05-31 Reihane Zoghifard , Massoud Pourmahdian

We investigate the logical foundations of hyperproperties. Hyperproperties generalize trace properties, which are sets of traces, to sets of sets of traces. The most prominent application of hyperproperties is information flow security:…

Logic in Computer Science · Computer Science 2017-01-10 Bernd Finkbeiner , Martin Zimmermann

First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…

Logic in Computer Science · Computer Science 2024-05-31 Luca Geatti , Alessandro Gianola , Nicola Gigante

In this short note we compare the expressive power of real-valued continuous logic (or just continuous logic, in recent literature) with that of compact-valued continuous logic, proposed by Chang and Keisler. We conclude that the two logics…

Logic · Mathematics 2022-07-06 Itaï Ben Yaacov

This note contains some material promised in our earlier papers on submodel preservation and the guarded fragment, along with some information on the current status of the problems mentioned in these papers. Section 1 contains an early…

Logic · Mathematics 2023-03-30 H. Andréka , J. van Benthem , I. Németi

We prove preservation theorems for $\mathcal{L}_{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{\omega_1,…

Logic · Mathematics 2019-12-30 Christian Espíndola

We prove new characterisations of exponential stability for positive linear discrete-time systems in ordered Banach spaces, in terms of small-gain conditions. Such conditions have played an important role in the finite-dimensional systems…

Functional Analysis · Mathematics 2021-07-19 Jochen Glück , Andrii Mironchenko

We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^{\omega}}\text{IFP}$ captures the limited…

Logic in Computer Science · Computer Science 2022-09-07 Kexu Wang , Xishun Zhao

Banach's fixed point theorem in linear n-normed space is being developed. Also, we present several theorems on fixed points in linear n-normed space.

Metric Geometry · Mathematics 2022-10-17 Prasenjit Ghosh , T. K. Samanta

The paper is a short survey of recent developments in the area of first order descriptions of linear groups. It is aimed to illuminate the known results and to pose the new problems relevant to logical characterizations of Chevalley groups…

Group Theory · Mathematics 2020-10-09 Eugene Plotkin

First-order logic is typically presented as the study of deduction in a setting with elementary quantification. In this paper, we take another vantage point and conceptualize first-order logic as a linear space that encodes "plausibility".…

Logic in Computer Science · Computer Science 2020-01-31 Daniel Huang

We propose a novel logic, called Frame Logic (FL), that extends first-order logic (with recursive definitions) using a construct Sp(.) that captures the implicit supports of formulas -- the precise subset of the universe upon which their…

Logic in Computer Science · Computer Science 2022-09-27 Adithya Murali , Lucas Peña , Christof Löding , P. Madhusudan

This paper seeks to apply categorical logic to the design of artificial intelligent agents that reason symbolically about objects more richly structured than sets. Using Johnstone's sequent calculus of terms- and formulae-in-context, we…

Artificial Intelligence · Computer Science 2025-04-29 Ralph Wojtowicz

The first named author introduced the notion of upper stability for metric spaces as a relaxation of stability. The motivation was a search for a new invariant to distinguish the class of reflexive Banach spaces from stable metric spaces in…

Functional Analysis · Mathematics 2023-09-21 F. Baudier , Th. Schlumprecht , A. Zsák

We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics extended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest Fixed Point Logic, and we prove that all…

Logic in Computer Science · Computer Science 2013-05-01 Pietro Galliani , Lauri Hella

Recently Ferraris, Lee and Lifschitz proposed a new definition of stable models that does not refer to grounding, which applies to the syntax of arbitrary first-order sentences. We show its relation to the idea of loop formulas with…

Artificial Intelligence · Computer Science 2023-07-21 Joohyung Lee , Yunsong Meng

We show that constructible models of arbitrary complete continuous first-order theories are unique up to isomorphism.

Logic · Mathematics 2025-01-07 James E. Hanson

In this article, the local convergence analysis of the multi-step seventh order method is presented for solving nonlinear equations. The point worth noting in our paper is that our analysis requires a weak hypothesis where the Fr\'echet…

Numerical Analysis · Mathematics 2021-12-14 Akanksha Saxena , J. P. Jaiswal , K. R. Pardasani