There are Infinitely Many Countable Models of Strictly Stable Theories With no Dense Forking Chains
Thickness, and a categoric view of type-space functors
We define the class of thick cats (compact abstract theories, which contains in particular semi-Hausdorff, Hausdorff and first order cats), and prove that in this class simplicity behaves as in first order theories. We consider well-known first order notions, such as interpretability or stable dividing/reduct, and propose analogous notions that can be naturally expressed in terms of maps between type-space functors. We prove several desirable properties of the new notions and show the connection...
Thorn orthogonality and domination in unstable theories
We study orthogonality, domination, weight, regular and minimal types in the contexts of rosy and super-rosy theories.
Three generators for minimal writing-space computations
Three generators for minimal writing-space computations
We construct, for each integer n, three functions from {0,1}n to {0,1} such that any boolean mapping from {0,1}n to {0,1}n can be computed with a finite sequence of assignations only using the n input variables and those three functions.
Three notes on the complexity of model checking fixpoint logic with chop
This paper analyses the complexity of model checking fixpoint logic with Chop – an extension of the modal μ-calculus with a sequential composition operator. It uses two known game-based characterisations to derive the following results: the combined model checking complexity as well as the data complexity of FLC are EXPTIME-complete. This is already the case for its alternation-free fragment. The expression complexity of FLC is trivially P-hard and limited from above by the complexity of solving...
Three problems of S. M. Ulam with solutions and generalizations
Three Propositions Equivalent To The Axiom Of Choice
Three semantical interpretations of a statistical theoremhood testing procedure
Three-quantifier sentences
We give a complete proof that all 3-quantifier sentences in the primitive notation of set theory (∈, =), are decided in ZFC, and in fact in a weak fragment of ZF without the power set axiom. We obtain information concerning witnesses of 2-quantifier formulas with one free variable. There is a 5-quantifier sentence that is not decided in ZFC (see [2]).
Three-valued logic and cut-elimination: The actual meaning of Takeuti's conjecture [Book]
Thue Congruences and the Church-Rosser property.
Tibor Neubrunn (1929 – 1990) [Book]
Tietze Extension Theorem for n-dimensional Spaces
In this article we prove the Tietze extension theorem for an arbitrary convex compact subset of εn with a non-empty interior. This theorem states that, if T is a normal topological space, X is a closed subset of T, and A is a convex compact subset of εn with a non-empty interior, then a continuous function f : X → A can be extended to a continuous function g : T → εn. Additionally we show that a subset A is replaceable by an arbitrary subset of a topological space that is homeomorphic with a convex...
Tietze extension theorem for pairwise ordered fuzzy extremally disconnected spaces
In this paper a new class of fuzzy topological spaces called pairwise ordered fuzzy extremally disconnected spaces is introduced. Tietze extension theorem for pairwise ordered fuzzy extremally disconnected spaces has been discussed as in the paper of Kubiak (1987) besides proving several other propositions and lemmas.
Tightly packed families of sots
Time change of objects and problem of their identification
Time conditional propositions
Todorcevic orderings as examples of ccc forcings without adding random reals
In [Two examples of Borel partially ordered sets with the countable chain condition, Proc. Amer. Math. Soc. 112 (1991), no. 4, 1125–1128], Todorcevic introduced a ccc forcing which is Borel definable in a separable metric space. In [On Todorcevic orderings, Fund. Math., to appear], Balcar, Pazák and Thümmel applied it to more general topological spaces and called such forcings Todorcevic orderings. There they analyze Todorcevic orderings quite deeply. A significant remark is that Thümmel solved...
Toeplitz matrices and convergence
We investigate , the minimum cardinality of a subset of that cannot be made convergent by multiplication with a single matrix taken from , for different sets of Toeplitz matrices, and show that for some sets it coincides with the splitting number. We show that there is no Galois-Tukey connection from the chaos relation on the diagonal matrices to the chaos relation on the Toeplitz matrices with the identity on as first component. With Suslin c.c.c. forcing we show that < is consistent...