A partial comparison of two conditions on the intersections of regressive sets.
A partial order where all monotone maps are definable
It is consistent that there is a partial order (P,≤) of size such that every monotone function f:P → P is first order definable in (P,≤).
A partition theorem for α-large sets
A polarized partition relation and failure of GCH at singular strong limit
The main result is that for λ strong limit singular failing the continuum hypothesis (i.e. ), a polarized partition theorem holds.
A poset hierarchy
This article extends a paper of Abraham and Bonnet which generalised the famous Hausdorff characterisation of the class of scattered linear orders. They gave an inductively defined hierarchy that characterised the class of scattered posets which do not have infinite incomparability antichains (i.e. have the FAC). We define a larger inductive hierarchy κℌ* which characterises the closure of the class of all κ-well-founded linear orders under inversions, lexicographic sums and FAC weakenings. This...
A possibilistic view on set and multiset comparison
A possibility-free logic of descriptions.
A Possible Characterization of Generic Structures.
A possible modal reformulation of comprehension scheme
A primrose path from Krull to Zorn
Given a set of “indeterminates” and a field , an ideal in the polynomial ring is called conservative if it contains with any polynomial all of its monomials. The map yields an isomorphism between the power set and the complete lattice of all conservative prime ideals of . Moreover, the members of any system of finite character are in one-to-one correspondence with the conservative prime ideals contained in , and the maximal members of correspond to the maximal ideals contained in...
A principal topology obtained from uninorms
We obtain a principal topology and some related results. We also give some hints of possible applications. Some mathematical systems are both lattice and topological space. We show that a topology defined on the any bounded lattice is definable in terms of uninorms. Also, we see that these topologies satisfy the condition of the principal topology. These topologies can not be metrizable except for the discrete metric case. We show an equivalence relation on the class of uninorms on a bounded lattice...
A probabilistic approach to automaton-environment systems
A problem on series of ordinals
A Programmatic Note: on two Types of Intertextuality
The note addresses briefly some reactions to a previous article “Deuteronomic Texts: Late Antiquity and the History of Mathematics”. In particular it looks at the question: if indeed any text must depend on previous texts, what makes the dependency of commentary and commentary-like text so special to justify my emphasis on this form of writing ? A suggestion is developed, trying to define Deuteronomic texts through their precise semiotics of intertextuality: in general, it is argued, intertextuality...
A proof (involving Martin's axiom) of a partition relation
A proof of Rasiowa-Sikorski theorem via complete sequences
A proof of Saffe's conjecture
A proof of the independence of the Axiom of Choice from the Boolean Prime Ideal Theorem
We present a proof of the Boolean Prime Ideal Theorem in a transitive model of ZF in which the Axiom of Choice does not hold. We omit the argument based on the full Halpern-Läuchli partition theorem and instead we reduce the proof to its elementary case.
A proof of the valuation property and preparation theorem
The purpose of this article is to present a short model-theoretic proof of the valuation property for a polynomially bounded o-minimal theory T. The valuation property was conjectured by van den Dries, and proved for the polynomially bounded case by van den Dries-Speissegger and for the power bounded case by Tyne. Our proof uses the transfer principle for the theory (i.e. T with an extra unary symbol denoting a proper convex subring), which-together with quantifier elimination-is due to van den...
A Proof Procedure for the First Order Logic