A generalized Feiner hierarchy.
A generalized Łoś ultraproduct theorem
A generalized version of the singular cardinals problem
A geometric form of the axiom of choice
A glimpse of deductive systems in algebra
The concept of a deductive system has been intensively studied in algebraic logic, per se and in connection with various types of filters. In this paper we introduce an axiomatization which shows how several resembling theorems that had been separately proved for various algebras of logic can be given unique proofs within this axiomatic framework. We thus recapture theorems already known in the literature, as well as new ones. As a by-product we introduce the class of pre-BCK algebras.
A Godel-Functional Interpretation of the ω-Rule
A gradient inequality at infinity for tame functions.
Let f be a C1 function defined over Rn and definable in a given o-minimal structure M expanding the real field. We prove here a gradient-like inequality at infinity in a neighborhood of an asymptotic critical value c. When f is C2 we use this inequality to discuss the trivialization by the gradient flow of f in a neighborhood of a regular asymptotic critical level.
A graphical representation of relational formulae with complementation
We study translations of dyadic first-order sentences into equalities between relational expressions. The proposed translation techniques (which work also in the converse direction) exploit a graphical representation of formulae in a hybrid of the two formalisms. A major enhancement relative to previous work is that we can cope with the relational complement construct and with the negation connective. Complementation is handled by adopting a Smullyan-like uniform notation to classify and decompose...
A graphical representation of relational formulae with complementation∗
We study translations of dyadic first-order sentences into equalities between relational expressions. The proposed translation techniques (which work also in the converse direction) exploit a graphical representation of formulae in a hybrid of the two formalisms. A major enhancement relative to previous work is that we can cope with the relational complement construct and with the negation connective. Complementation is handled by adopting a Smullyan-like...
A group in a group.
A groupoid characterization of Boolean algebras
We present a groupoid which can be converted into a Boolean algebra with respect to term operations. Also conversely, every Boolean algebra can be reached in this way.
A groupoid formulation of the Baire Category Theorem
We prove that the Baire Category Theorem is equivalent to the following: Let G be a topological groupoid such that the unit space is a complete metric space, and there is a countable cover of G by neighbourhood bisections. If G is effective, then G is topologically principal.
A Hamiltonian property of connected sets in the alternative set theory.
A Hanf number for saturation and omission
Suppose t = (T,T₁,p) is a triple of two countable theories T ⊆ T₁ in vocabularies τ ⊂ τ₁ and a τ₁-type p over the empty set. We show that the Hanf number for the property ’there is a model M₁ of T₁ which omits p, but M₁ ↾ τ is saturated’ is essentially equal to the Löwenheim number of second order logic. In Section 4 we make exact computations of these Hanf numbers and note some distinctions between ’first order’ and ’second order quantification’. In particular, we show that if κ is uncountable,...
A hereditary property of HM-spaces.
A Hierarchy of Automatic ω-Words having a Decidable MSO Theory
We investigate automatic presentations of ω-words. Starting points of our study are the works of Rigo and Maes, Caucal, and Carton and Thomas concerning lexicographic presentation, MSO-interpretability in algebraic trees, and the decidability of the MSO theory of morphic words. Refining their techniques we observe that the lexicographic presentation of a (morphic) word is in a certain sense canonical. We then generalize our techniques to a hierarchy of classes of ω-words enjoying the above...
A hierarchy of primitive recursive sequence functions
A hypercontinuous hypersmooth Schwarzschild line element transformation.
A Kalmár-style completeness proof for the logics of the hierarchy
The logics of the family := are formally defined by means of finite matrices, as a simultaneous generalization of the weakly-intuitionistic logic and of the paraconsistent logic . It is proved that this family can be naturally ordered, and it is shown a sound and complete axiomatics for each logic of the form . The involved completeness proof showed here is obtained by means of a generalization of the well-known Kalmár’s method, usually applied for many-valued logics.
A large cardinal in the constructible universe