English
Related papers

Related papers: On perturbations of continuous structures

200 papers

This paper introduces robust differential dynamic logic (a fragment of differential dynamic logic) to specify and reason about robust hybrid systems. Practically meaningful syntactic restrictions naturally ensure that definable properties…

Logic in Computer Science · Computer Science 2026-02-27 Noah Abou El Wafa , André Platzer

Given a structure $M$ we introduce infinitary logic expansions, which generalise the Morleyisation. We show that these expansions are tame, in the sense that they preserve and reflect both the Embedding Ramsey Property (ERP) and the…

Logic · Mathematics 2023-06-29 Nadav Meir , Aris Papadopoulos

Discontinuity with respect to data perturbations is common in algebraic computation where solutions are often highly sensitive. Such problems can be modeled as solving systems of equations at given data parameters. By appending auxiliary…

Numerical Analysis · Mathematics 2021-02-17 Zhonggang Zeng

We study the topology of a class of proper submodules and some of its distinguished subclasses and call them structure spaces. We give several criteria for the quasi-compactness of these structure spaces. We study $T_0$ and $T_1$ separation…

Rings and Algebras · Mathematics 2023-04-18 Amartya Goswami

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

We develop a combinatorial and order-theoretic framework for shuffles, understood as ordered concatenations of indexed families of sequences that induce total orders on the natural numbers. Motivated by the classical \v{S}arkovski\u{i}…

Combinatorics · Mathematics 2026-02-03 João Dias , Bruno Dinis , Carlos Correia Ramos

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

Small networks of chaotic units which are coupled by their time-delayed variables, are investigated. In spite of the time delay, the units can synchronize isochronally, i.e. without time shift. Moreover, networks can not only synchronize…

Chaotic Dynamics · Physics 2009-11-13 Johannes Kestler , Evi Kopelowitz , Ido Kanter , Wolfgang Kinzel

We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes…

Logic in Computer Science · Computer Science 2015-03-24 Vilem Vychodil

We study the topological structure and the topological dynamics of groups of homeomorphisms of scattered spaces. For a large class of them (including the homeomorphism group of any ordinal space or of any locally compact scattered space),…

Group Theory · Mathematics 2020-12-01 Maxime Gheysens

While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the…

Logic in Computer Science · Computer Science 2014-06-09 Daniel Gorín , Lutz Schröder

Large Language Models (LLMs) have exhibited remarkable reasoning capabilities, achieving impressive results across a wide range of tasks. Despite these advances, significant reasoning failures persist, occurring even in seemingly simple…

Artificial Intelligence · Computer Science 2026-02-09 Peiyang Song , Pengrui Han , Noah Goodman

We establish new estimates for the size and structure of the nodal set $\{u=0\}$ and the singular set $\{u=|\nabla u|=0\}$ of solutions $u$ to parabolic inequalities with parabolic Lipschitz coefficients. In particular, we show that almost…

Analysis of PDEs · Mathematics 2025-11-21 Max Hallgren , Robert Koirala , Zilu Ma

The factorizable vectors of a complete Boolean algebra of type I factors, acting on a separable Hilbert space, are shown to be total, resolving a conjecture of Araki and Woods. En route, the spectral theory of noise-type Boolean algebras of…

Operator Algebras · Mathematics 2024-08-06 Matija Vidmar

We study aggregations for ordinary differential equations induced by fluid semantics for Markovian process algebra which can capture the dynamics of performance models and chemical reaction networks. Whilst previous work has required…

Performance · Computer Science 2014-06-10 Max Tschaikowski , Mirco Tribastone

A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…

Logic in Computer Science · Computer Science 2012-04-16 Mnacho Echenim , Nicolas Peltier

Perturbation of logarithmic conformal field theories is investigated using Zamolodchikov's method. We derive conditions for the perturbing operator, such that the perturbed model be integrable. We also consider an example where integrable…

High Energy Physics - Theory · Physics 2008-11-26 M. A. Rajabpour , S. Rouhani

In this paper, ordinary and exponential dichotomies are defined in differential equations with equations with piecewise constant argument of general type. We prove the asymptotic equivalence between the bounded solutions of a linear system…

Classical Analysis and ODEs · Mathematics 2015-09-29 Aníbal Coronel , Christopher Maulén , Manuel Pinto , Daniel Sepúlveda

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

Logic · Mathematics 2008-06-04 Wesley Calvert

Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize the abstract separation systems that have representations as…

Combinatorics · Mathematics 2025-05-16 Nathan Bowler , Jay Lilian Kneip
‹ Prev 1 8 9 10 Next ›