English
Related papers

Related papers: Bounds on Continuous Scott Rank

200 papers

The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…

Logic in Computer Science · Computer Science 2020-02-17 Marianna Girlando , Sara Negri , Nicola Olivetti

We prove a conjecture due to V.V. Shokurov on the boundedness of $\epsilon$-log canonical complements on surfaces. As an application we give a new proof to the boundedness of weak log Fano surfaces.

Algebraic Geometry · Mathematics 2007-05-23 Caucher Birkar

One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…

Commutative Algebra · Mathematics 2017-11-13 Richard Gustavson , Omar León Sánchez

In this paper, the authors provide a weak decoding version of the traditional source coding theorem of Claude Shannon. The central bound that is obtained is \[ \chi>\log_{\epsilon}(2^{-n(H(X)+\epsilon)}) \] where \[…

Information Theory · Computer Science 2022-09-13 Aman Chawla

In this paper we translate the necessary and sufficient conditions of Tanaka's theorem on the finiteness of effective prolongations of a fundamental graded Lie algebras into computationally effective criteria, involving the rank of some…

Differential Geometry · Mathematics 2019-10-21 Stefano Marini , Costantino Medori , Mauro Nacinovich

The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…

Logic in Computer Science · Computer Science 2021-09-20 Jan Rooduijn , Yde Venema

We investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely the star height of regular languages. We explore this…

Discrete Mathematics · Computer Science 2013-04-17 Hermann Gruber

We produce a class of $\omega$-categorical structures with finite signature by applying a model-theoretic construction -- a refinement of the Hrushosvki-encoding -- to $\omega$-categorical structures in a possibly infinite signature. We…

Logic in Computer Science · Computer Science 2021-01-12 Pierre Gillibert , Julius Jonušas , Michael Kompatscher , Antoine Mottet , Michael Pinsker

A systematic theory of structural limits for finite models has been developed by Nesetril and Ossona de Mendez. It is based on the insight that the collection of finite structures can be embedded, via a map they call the Stone pairing, in a…

Logic in Computer Science · Computer Science 2023-06-22 Mai Gehrke , Tomáš Jakl , Luca Reggio

The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category $\mathcal D$. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the…

Logic in Computer Science · Computer Science 2023-06-22 Jiří Adamek , Stefan Milius , Henning Urbat

We introduce and investigate a topological version of St\"ackel's 1907 characterization of finite sets, with the goal of obtaining an interesting notion that characterizes usual compactness (or a close variant of it). Define a $T_2$…

General Topology · Mathematics 2024-03-11 Abhijit Dasgupta

We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…

Computational Complexity · Computer Science 2024-10-29 Pravesh K. Kothari , Peter Manohar

We describe an error in the proof of a key proposition, which was necessary for the proof of the main result. Alternate proofs of the main result are given by Ozsvath-Stipsicz-Szabo and Dai-Hom-Stoffregen-Truong.

Geometric Topology · Mathematics 2019-10-23 Jennifer Hom

Abashidze and Blass independently proved that the modal logic $\sf{GL}$ is complete for its topological interpretation over any ordinal greater than or equal to $\omega^\omega$ equipped with the interval topology. Icard later introduced a…

Logic · Mathematics 2015-11-19 Juan P. Aguilera , David Fernández-Duque

Local GCD Equivalence is a relation between extensions of number fields which is weaker than the classical arithmetic equivalence. It was originally studied by Lochter with Weak Kronecker Equivalence. Among the many results he got, Lochter…

Number Theory · Mathematics 2021-01-18 Francesco Battistoni

Friedman and Stanley developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For many embeddings, the fact that the embedding is $1-1$ on…

Logic · Mathematics 2026-05-07 David Gonzalez , Julia Knight

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

Formal Languages and Automata Theory · Computer Science 2025-02-03 Corentin Barloy , Michaël Cadilhac , Charles Paperman , Howard Straubing

We give an upper bound for the rank $r$ of homogeneous (even) Clifford structures on compact manifolds of non-vanishing Euler characteristic. More precisely, we show that if $r=2^a\cdot b$ with $b$ odd, then $r\le 9$ for $a=0$, $r\le 10$…

Differential Geometry · Mathematics 2019-01-08 Andrei Moroianu , Mihaela Pilca

Forward self-similar and discretely self-similar weak solutions of the Navier-Stokes equations are known to exist globally in time for large self-similar and discretely self-similar initial data and are known to be regular outside of a…

Analysis of PDEs · Mathematics 2023-06-28 Zachary Bradshaw , Patrick Phelps

Following a survey of the abstract boundary definition of Scott and Szekeres, a rigidity result is proved for the smooth case, showing that the topological structure of the regular part of this boundary in invariantly defined.

General Relativity and Quantum Cosmology · Physics 2009-10-31 C. J. Fama , C. J. S. Clarke