Related papers: On the existence property over a predicate
We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…
We show that for a large class of piecewise expanding maps T, the bounded p-variation observables u_0 that admits an infinite sequence of bounded p-variation observables u_i satisfying u_i(x)= u_{i+1}(Tx) -u_{i+1}(x) are constant. The…
We provide a new characterization of amenability for countable groups, based on frame representations admitting almost invariant vectors. By relaxing the frame inequalities, thereby weakening amenability, we obtain a large class of…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
We answer a question of Pakhomov by showing that there is a consistent, c.e. theory $T$ such that no theory which is definitionally equivalent to $T$ has a computable model. A key tool in our proof is the model-theoretic notion of mutual…
This paper presents a formal characterisation of safety and liveness properties \`a la Alpern and Schneider for fully probabilistic systems. As for the classical setting, it is established that any (probabilistic tree) property is…
We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
We study existential theories of henselian valued fields of positive characteristic with parameters from a trivially valued subfield. Compared to previous work, we relax perfectness and separability assumptions, and instead work with the…
Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…
An \'etale structure over a topological space $X$ is a continuous family of structures (in some first-order language) indexed over $X$. We give an exposition of this fundamental concept from sheaf theory and its relevance to countable model…
Given a sound first-order p-time theory $T$ capable of formalizing syntax of first-order logic we define a p-time function $g_T$ that stretches all inputs by one bit and we use its properties to show that $T$ must be incomplete. We leave it…
The stable reduction theorem says that a family of curves of genus $g\geq 2$ over a punctured curve can be uniquely completed (after possible base change) by inserting certain stable curves at the punctures. We give a new proof of this…
By the result of Dixmier, any weight space of enveloping algebra of Lie algebra L over a field of characteristic 0 is adL stable. In this paper we will show that this result need not be true, if F is replaced by a field of prime…
Three philosophical principles are often quoted in connection with Leibniz: "objects sharing the same properties are the same object" (Identity of indiscernibles), "everything can possibly exist, unless it yields contradiction" (Possibility…
We introduce the notion of a probabilistic identity of a residually finite group. We prove that a finitely generated linear group satisfies a probabilistic identity if and only if it is virtually solvable. As an application, we prove a…
The famous G\"odel incompleteness theorem says that for every sufficiently rich formal theory (containing formal arithmetic in some natural sense) there exist true unprovable statements. Such statements would be natural candidates for being…
This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…