An algebraic and logical approach to continuous images
An algebraic approach to the Heyting-Brouwer predicate calculus
An algebraic completeness proof for Kleene's 3-valued logic
We introduce Kleene's 3-valued logic in a language containing, besides the Boolean connectives, a constant for the undefined truth value, so in developing semantics we can switch from the usual treatment based on DM-algebras to the narrower class of DMF-algebras (De Morgan algebras with a single fixed point for negation). A sequent calculus for Kleene's logic is introduced and proved complete with respect to threevalent semantics. The completeness proof is based on a version of the prime ideal...
An algebraic description of locally multipresentable categories.
An algebraic equivalent of a multiple choice axiom
An algebraic treatment of flow diagrams and its application to generalized recursion theory
An algorithm for the word problem in extensions and the dependence of its complexity on the group representation
An algorithm of calculation of lower solutions of fuzzy relational equations.
This paper deals with the problem of the determination of lower solutions of fuzzy relational equations. An algorithm of calculation of such a solution is presented.
An Algorithm to Compute theTransitive Closure, a Transitive Approximation and a Transitive Opening of a Fuzzy Proximity.
An alternative approach to rough sets
An alternative proof of Hill's criterion of freeness for Abelian groups.
An alternative proof of the ultralimits theorem.
An analysis of Karp’s interpolation theorem and the notion of -consistency property
An analytic equivalence relation not arising from a Polish group action
An application of a reflection principle
We define a recursive theory which axiomatizes a class of models of IΔ₀ + Ω ₃ + ¬ exp all of which share two features: firstly, the set of Δ₀ definable elements of the model is majorized by the set of elements definable by Δ₀ formulae of fixed complexity; secondly, Σ₁ truth about the model is recursively reducible to the set of true Σ₁ formulae of fixed complexity.
An application of higher order fixed points of normal functions.
An application of logical-probabilistic expressions to the realization of stochastic automata
An application of nonstandard analysis to functional equations.
An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions.
An Application of Shoenfield's Absoluteness Theorem to the Theory of Uniform Distribution.