A combinatorial analysis of functions provably recursive in
A Complete Boolean Algebra without Homogeneous or Rigid Factors.
A complete characterization of primitive recursive intensional behaviours
We give a complete characterization of the class of functions that are the intensional behaviours of primitive recursive (PR) algorithms. This class is the set of primitive recursive functions that have a null basic case of recursion. This result is obtained using the property of ultimate unarity and a geometrical approach of sequential functions on N the set of positive integers.
A Completenes Theorem for an Infinitary Intutionistic Logic With Both Ordinary and Probability Quantifiers
A completeness theorem for the general interpreted modal calculus of A. Bressan
A completeness theorem for two-parameter stochastic processes
A completeness theorem in the modal logic of programs
A Completness Theorem For One Class Of The Propositional Calculi
A conjecture of Ershov for a relative hierarchy fails near .
A connection between Computer Science and Fuzzy Theory: Midpoints and running time of computing.
A consistency result on weak reflection
A constructive analysis of convex-valued demand correspondence for weakly uniformly rotund and monotonic preference.
A constructive “Closed subgroup theorem” for localic groups and groupoids
A constructive proof of equivalence of formalism of DCG's with the formalism of type 0 phrase-structure grammars.
A constructive proof of the Tychonoff's theorem for locales
A constructivist theory of plane curves
A continuous, constructive solution to Hilbert's 17th problem.
A continuum of totally incomparable hereditarily indecomposable Banach spaces
A family is constructed of cardinality equal to the continuum, whose members are totally incomparable hereditarily indecomposable Banach spaces.
A contour view on uninorm properties
Any given increasing function is completely determined by its contour lines. In this paper we show how each individual uninorm property can be translated into a property of contour lines. In particular, we describe commutativity in terms of orthosymmetry and we link associativity to the portation law and the exchange principle. Contrapositivity and rotation invariance are used to characterize uninorms that have a continuous contour line.
A contribution to topology in AST: Almost indiscernibilities