How to generalize logic programming to arbitrary set of clauses.
How to handle fuzzy-quantities?
How to make your logic fuzzy.
The aim of this paper is to provide a methodology for turning a known crisp logic into a fuzzy system. We require of the methodology that it be meaningful in general terms, using processes which are independent of the notion of fuzziness, and that it yield a considerable number of known fuzzy systems.
How to recognize a true Σ^0_3 set
Let X be a Polish space, and let be a sequence of hereditary subsets of K(X) (the space of compact subsets of X). We give a general criterion which allows one to decide whether is a true subset of K(X). We apply this criterion to show that several natural families of thin sets from harmonic analysis are true .
Hurewicz properties, non distinguishing convergence properties and sequence selection properties
Hurewicz scheme
Hybrid Prikry forcing
We present a new forcing notion combining diagonal supercompact Prikry forcing with interleaved extender based forcing. We start with a supercompact cardinal κ. In the final model the cofinality of κ is ω, the singular cardinal hypothesis fails at κ, and GCH holds below κ. Moreover we define a scale at κ which has a stationary set of bad points in the ground model.
Hydrological applications of a model-based approach to fuzzy set membership functions
Since the common approach to defining membership functions of fuzzy numbers is rather subjective, another, more objective method is proposed. It is applicable in situations where two models, say and , share the same uncertain input parameter . Model is used to assess the fuzziness of , whereas the goal is to assess the fuzziness of the -dependent output of model . Simple examples are presented to illustrate the proposed approach.
Hyperarithmetical Boolean algebras with a distinguished ideal.
Hyperbolic geometry in terms of point-reflections or of line-orthogonality.
Hyperdefinite stochastic integration I: The nonstandard theory.
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