Related papers: The Mostowski Bridge
By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…
For each $n\in\mathbb{N}$, let $[n]\phi$ mean "the sentence $\phi$ is true in all $\Sigma_{n+1}$-correct transitive sets." Assuming G\"odel's axiom $V = L$, we prove the following graded variant of Solovay's completeness theorem: the set of…
In this paper we present a new proof of Solovay's theorem on arithmetical completeness of G\"odel-L\"ob provability logic GL. Originally, completeness of GL with respect to interpretation of $\Box$ as provability in PA was proved by R.…
The $n$-th Zariski topology on a group $G$ is generated by the sub-base consiting of the cozero sets of monomials of degree $\le n$ on $G$. We prove that for each group $G$ the 2-nd Zariski topology is not discrete and present an example of…
The Morse-Sard theorem requires that a mapping $v:R^n \to R^m$ is of class $C^k$, $k>n-m$. In 1957 Dubovitski\u{\i} generalized this result by proving that almost all level sets for a $C^k$ mapping have $H^s$-negligible intersection with…
We prove in ZF a recursive-theoretic characterization of the Topological Vaught Conjecture by revisiting the fact that orbits in Polish $G$-spaces are Borel sets.
We show that various actions of topological conformal theories that were suggested recentely are particular cases of a general action. We prove the invariance of these models under transformations generated by nilpotent fermionic generators…
The seminal papers in the field of root-discriminant bounds are those of Odlyzko and Martinet. Both papers include the question of whether the field $\mathbb{Q}(\sqrt{-5460})$ has finite or infinite $2$-class tower. This is a critical case…
In this work, an extension of two-point Ostrowski's formula for $n$-times differentiable functions is proved. A generalization of Taylor formula is deduced. An identity of Fink type for this extension is provided. Error estimates for the…
In 1933, G\"odel considered two modal approaches to describing provability. One captured formal provability and resulted in the logic GL and Solovay's Completeness Theorem. The other was based on the modal logic S4 and led to Artemov's…
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…
We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…
In this paper, we develop some foundations for a theory of algebraic varieties of congruences on commutative semirings. By studying the structure of congruences, firstly, we show that the spectrum $ \text{Spec}^{c}(A) $ consisting of prime…
Tarski's undefinability theorem states that a formal system based on conventional predicate logic (PL) cannot talk about its own truth predicate. PL is, however, not the only formal language imaginable. In this paper, it will be shown that…
We investigate the non-elementary computational complexity of a family of substructural logics without contraction. With the aid of the technique pioneered by Lazi\'c and Schmitz (2015), we show that the deducibility problem for full Lambek…
These are notes, by Z. Fiedorowicz, from lectures given by J. Frank Adams at the University of Chicago in spring of 1973. They give an elegant axiomatic presentation of localization and completion in algebraic topology. The construction of…
It has been shown in this paper that the commutative Frobenius algebra $QZ_5\otimes Z(QS_3)$ provides a complete invariant for two-dimensional cobordisms, i.e., that the corresponding two-dimensional quantum field theory is faithful. The…
We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…
In this paper, for each graph G, a free edge set F is defined. To study the existence of cycle double cover, the naive cycle double cover of G and F have been defined and studied. In the main theorem, the paper, based on the Kuratowski…
Let G be a Roelcke-precompact non-archimedean Polish group, B(G) the algebra of matrix coefficients of G arising from its continuous unitary representations. The Gel'fand spectrum H(G) of the norm closure of B(G) is known as the Hilbert…