Related papers: A presentation theorem for continuous logic and Me…
In this paper we investigate using the methodology of algebraic logic, deep algebraic results to prove three new omitting types theorems for finite variable fragments of first order logic. As a sample, we show that it T is an L_n theory and…
We develop a representation theory for $\lambda$-lattices, arising as standard invariants of subfactors, and for rigid C*-tensor categories, including a definition of their universal C*-algebra. We use this to give a systematic account of…
In this workshop, we present a compact but rigorous introduction to the basic language of nonlinear programming, variational inequalities, and complementarity systems. The goal is twofold. First, we explain the mathematical logic of…
Cirquent calculus is a novel proof theory permitting component-sharing between logical expressions. Using it, the predecessor article "Elementary-base cirquent calculus I: Parallel and choice connectives" built the sound and complete…
We prove in this paper that, under suitable coinditions on an initial data set, we can obtain Area and Curvature Estimates for simple marginally outer trapped surfaces (or MOTS). Using this estimates, we derive a Compactness Theorem for…
We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with states and internal variables given by uninterpreted…
We consider weighted structures, which extend ordinary relational structures by assigning weights, i.e. elements from a particular group or ring, to tuples present in the structure. We introduce an extension of first-order logic that allows…
We develop a theory of generalized presentations of groups. We give generalized presentations of the symmetric group $\Sigma(X)$ for an arbitrary set $X$ and of the automorphism group of the free group of countable rank, $Aut(F_{\omega})$.
We include alignment interactions in a well-studied first-order attractive-repulsive macroscopic model for aggregation. The distinctive feature of the extended model is that the equation that specifies the velocity in terms of the…
Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…
For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
In this paper we prove: Theorem 1. Let $\mathcal{K}$ be an abstract elementary class which satisfies the joint embedding and amalgamation properties. Suppose $\lambda>\mu\geq LS(\mathcal{K})$ and $\theta$ is a limit ordinal $<\lambda^+$. If…
We study first and second order theories of relativistic diffusion coupled to hydrodynamics under the approximation, valid at mid-rapidity in the RHIC and LHC, that conserved number densities are much smaller than the entropy density. We…
We introduce the notion of \tau-like partial order, where \tau is one of the linear order types \omega, \omega*, \omega+\omega*, and \zeta. For example, being \omega-like means that every element has finitely many predecessors, while being…
Lindstr\"om theorem obviously fails as a characterization of $\mathcal{L}_{\omega \omega}^{-} $, first-order logic without identity. In this note we provide a fix: we show that $\mathcal{L}_{\omega \omega}^{-} $ is \emph{maximal} among…
This paper presents an abstract, mathematical formulation of classical propositional logic. It proceeds layer by layer: (1) abstract, syntax-free propositions; (2) abstract, syntax-free contraction-weakening proofs; (3) distribution; (4)…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
We consider a first-order aggregation model in both discrete and continuum formulations and show rigorously how it can be obtained as zero inertia limits of second-order models. In the continuum case the procedure consists in a macroscopic…
We show that for 1<n<m, the class Nr_nCA_m known to be non-elementary is pseudo elementary. When n and m are finite we use a two sorted theory, when n is finite and m infinite we use a three sorted one, and finally when both are infinite we…