Related papers: Maximality of logic without identity
We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{\omega_1,\omega}$. Theorem: Let $T$ be any complete first-order theory in a countable language…
Let $\alpha \in (0,1)_{\mathbb{R}}$ be irrational and $G_n = G_{n,1/n^\alpha}$ be the random graph with edge probability $1/n^\alpha$; we know that it satisfies the 0-1 law for first order logic. We deal with the failure of the 0-1 law for…
Let $T$ be a complete, superstable theory with fewer than $2^{\aleph_{0}}$ countable models. Assuming that generic types of infinite, simple groups definable in $T^{eq}$ are sufficiently non-isolated we prove that $\omega^{\omega}$ is the…
MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-algebras generated by a finite chain are Heyting algebras where the Godel implication can be written in terms of De Morgan and Moisil's modal operators. In our work, a…
We introduce the class of \emph{Log-Noetherian} (LN) functions. These are holomorphic solutions to algebraic differential equations (in several variables) with logarithmic singularities. We prove an upper bound on the number of solutions…
It is a well-known result in pointfree topology that every locally compact frame is spatial. Whether this result extends to MT-algebras (McKinsey-Tarski algebras) was an open problem. We resolve it in the negative by constructing a locally…
We investigate a correspondence between the complexity hierarchy of constraint satisfaction problems and a hierarchy of logical compactness hypotheses for finite relational structures. It seems that the harder a constraint satisfaction…
We revisit the work studying homomorphism preservation for first-order logic in sparse classes of structures initiated in [Atserias et al., JACM 2006] and [Dawar, JCSS 2010]. These established that first-order logic has the homomorphism…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
The logic $\mathcal L^1_\kappa$ was introduced by Shelah in [3]. In [4], he proved that for a strongly compact cardinal $\kappa$, it admits the following algebraic characterization: two structures are $\mathcal L^1_\kappa$-equivalent if and…
In this paper we prove that any local automorphism on the solvable Leibniz algebras with null-filiform and naturally graded non-Lie filiform nilradicals, whose dimension of complementary space is maximal is an automorphism. Furthermore, the…
A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…
Our first result is a noncommutative form of Jessen/Marcinkiewicz/Zygmund theorem for the maximal limit of multiparametric martingales or ergodic means. It implies bilateral almost uniform convergence with initial data in the expected…
We address questions of logic and expressibility in the context of random rooted trees. Infiniteness of a rooted tree is not expressible as a first order sentence, but is expressible as an existential monadic second order sentence (EMSO).…
Let $\pi$ be a unitary cuspidal automorphic representation of $\mathrm{GL}_n$ over a number field, and let $\tilde{\pi}$ be contragredient to $\pi$. We prove effective upper and lower bounds of the correct order in the short interval prime…
We study the links between the topological complexity of an omega context free language and its degree of ambiguity. In particular, using known facts from classical descriptive set theory, we prove that non Borel omega context free…
We consider continuous relational structures with finite domain $[n] := \{1, \ldots, n\}$ and a many valued logic, $CLA$, with values in the unit interval and which uses continuous connectives and continuous aggregation functions. $CLA$…
Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two…
We focus here on the analysis of the regularity or singularity of solutions $\Om_{0}$ to shape optimization problems among convex planar sets, namely: $$ J(\Om_{0})=\min\{J(\Om),\ \Om\ \textrm{convex},\ \Omega\in\mathcal S_{ad}\}, $$ where…
Formal mathematics and computer science proofs are formalized using Hilbert-Russell-style logical systems which are designed to not admit paradoxes and self-refencing reasoning. These logical systems are natural way to describe and reason…