Related papers: $\omega$-consistency for Different Arrays of Quant…
We study the collection of first-order logical schemata all of whose instances are theorems of a given theory $T$; we call these the validities of $T$ ($\mathsf{V}(T)$). It is easy to see that if $T$ is a decidable theory, then…
We lay the groundwork for a formal framework that studies scientific theories and can serve as a unified foundation for the different theories within physics. We define a scientific theory as a set of verifiable statements, assertions that…
We consider Vinberg $\theta$-groups associated to a cyclic quiver on $k$ nodes. Let $K$ be the product of the general linear groups associated to each node. Then $K$ acts naturally on $\oplus \text{Hom}(V_i, V_{i+1})$ and by Vinberg's…
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act itself has a finite presentation; it is weakly right coherent if every finitely generated right ideal of $S$ has a finite…
A metric algebra is a metric variant of the notion of $\Sigma$-algebra, first introduced in universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. In this paper, we showed metric versions of…
The famous \v{S}varc-Milnor Lemma says that a group $G$ acting properly and cocompactly via isometries on a length space $X$ is finitely generated and induces a quasi-isometry equivalence $g\to g\cdot x_0$ for any $x_0\in X$. We redefine…
Let $X$ be a non-singular irreducible complex projective curve of genus $g\geq 2$. We use $(t,\ell)$-stability to prove the existence of coherent systems over $X$ that are $\alpha$-stable for all allowed $\alpha >0$.
We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.
Godelian sentences of a sufficiently strong and recursively enumerable theory, constructed in Godel's 1931 groundbreaking paper on the incompleteness theorems, are unprovable if the theory is consistent; however, they could be refutable.…
We investigate combinations of structures by families of structures relative to families of unary predicates and equivalence relations. Conditions preserving $\omega$-categoricity and Ehrenfeuchtness under these combinations are…
This paper introduces the notion of control closure certificates to synthesize controllers for discrete-time control systems against $\omega$-regular specifications. Typical functional approaches to synthesize controllers against…
We propose axioms governing the interaction of constructive assertibility and meaningfulness predicates with a self-applicative truth predicate characterized by the T-scheme, and we prove the consistency of the resulting formal system.
Every countable language which conforms to classical logic is shown to have an extension which conforms to classical logic, and has a definitional theory of truth. That extension has a semantical theory of truth, if every sentence of the…
A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory…
We present evidence that the number of string/$M$ theory vacua consistent with experiments is a finite number. We do this both by explicit analysis of infinite sequences of vacua and by applying various mathematical finiteness theorems.
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…
We have witnessed the emergence of several controller parameterizations and the corresponding synthesis methods, including Youla, system level, input-output, and many other new proposals. Meanwhile, under the same synthesis method, there…
In this instructional exposition in Portuguese for the popularisation of mathematics, we state and prove the completeness theorem.
Consistency is the theoretical property of a meta learning algorithm that ensures that, under certain assumptions, it can adapt to any task at test time. An open question is whether and how theoretical consistency translates into practice,…
Two major challenges of numeric analytic continuation---restoring the spectral density, $s(\omega)$, from the corresponding Matsubara correlator, $g(\tau)$---are (i) producing the most smooth/featureless answer for $s(\omega)$ without…