Hyperdefinite stochastic integration II: Comparision with the standard theory.
Hyperdefinite stochastic integration III: Hyperdefinite representations of standard martingales.
Hyperfinite and standard unifications for physical theories.
Hyperidentities in associative graph algebras
Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies an identity s ≈ t if the correspondinggraph algebra A(G) satisfies s ≈ t. A graph G is called associative if the corresponding graph algebra A(G) satisfies the equation (xy)z ≈ x(yz). An identity s ≈ t of terms s and t of any type τ is called a hyperidentity of an algebra A̲ if whenever the operation symbols occurring in s and t are replaced...
Hyperplanes in matroids and the axiom of choice
We show that in set theory without the axiom of choice ZF, the statement sH: “Every proper closed subset of a finitary matroid is the intersection of hyperplanes including it” implies AC, the axiom of choice for (nonempty) finite sets. We also provide an equivalent of the statement AC in terms of “graphic” matroids. Several open questions stay open in ZF, for example: does sH imply the axiom of choice?
Hypersatisfaction of formulas in agebraic systems
In [2] the theory of hyperidentities and solid varieties was extended to algebraic systems and solid model classes of algebraic systems. The disadvantage of this approach is that it needs the concept of a formula system. In this paper we present a different approach which is based on the concept of a relational clone. The main result is a characterization of solid model classes of algebraic systems. The results will be applied to study the properties of the monoid of all hypersubstitutions of an...
Hypersequents and fuzzy logic.
Fuzzy logics based on t-norms and their residua have been investigated extensively from a semantic perspective but a unifying proof theory for these logics has, until recently, been lacking. In this paper we survey results of the authors and others which show that a suitable proof-theoretic framework for fuzzy logics is provided by hypersequents, a natural generalization of Gentzen-style sequents. In particular we present hypersequent calculi for the logic of left-continuous t-norms MTL and related...
Hyperstructures Associated with Ordered sets
Hypothèses et lois dans les sciences
I teoremi di assolutezza in teoria degli insiemi: prima parte
Questa è la prima parte di una articolo espositivo dedicato ai teoremi di assolutezza, un argomento che sta assumendo un’importanza via via più grande in teoria degli insiemi. In questa prima parte vedremo come le questioni di teoria dei numeri non siano influenzate da assunzioni insiemistiche quali l’assioma di scelta o l’ipotesi del continuo.
I teoremi di assolutezza in teoria degli insiemi: seconda parte
Questa è la seconda parte dell’articolo espositivo [A]. Qui vedremo come siapossibile utilizzare il forcinge gli assiomi forti dell’infinito per dimostrare nuovi teoremi sui numeri reali.
Ideal limits of sequences of continuous functions
We prove that for every Borel ideal, the ideal limits of sequences of continuous functions on a Polish space are of Baire class one if and only if the ideal does not contain a copy of Fin × Fin. In particular, this is true for ideals. In the proof we use Borel determinacy for a game introduced by C. Laflamme.
Idealisace a abstrakce
Idealized coinductive type systems for imperative object-oriented programs
In recent work we have proposed a novel approach to define idealized type systems for object-oriented languages, based on abstract compilation of programs into Horn formulas which are interpreted w.r.t. the coinductive (that is, the greatest) Herbrand model. In this paper we investigate how this approach can be applied also in the presence of imperative features. This is made possible by considering a natural translation of Static Single Assignment intermediate form programs into Horn formulas,...
Idealized coinductive type systems for imperative object-oriented programs
In recent work we have proposed a novel approach to define idealized type systems for object-oriented languages, based on abstract compilation of programs into Horn formulas which are interpreted w.r.t. the coinductive (that is, the greatest) Herbrand model. In this paper we investigate how this approach can be applied also in the presence of imperative features. This is made possible by considering a natural translation of Static Single Assignment intermediate form programs into Horn formulas,...
Ideals induced by Tsirelson submeasures
We use Tsirelson’s Banach space ([2]) to define an P-ideal which refutes a conjecture of Mazur and Kechris (see [12, 9, 8]).
Ideals of the second category
Ideals on the real line and Ulam's problem
Ideals which generalize (v 0)
Countable products of finite discrete spaces with more than one point and ideals generated by Marczewski-Burstin bases (assigned to trimmed trees) are examined, using machinery of base tree in the sense of B. Balcar and P. Simon. Applying Kulpa-Szymanski Theorem, we prove that the covering number equals to the additivity or the additivity plus for each of the ideals considered.
Idéaux et types sur les corps séparablement clos