All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 9 Next

Displaying 161 – 180 of 515

Showing per page

Hierarchies of function classes defined by the first-value operator

Armin Hemmerling (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

The first-value operator assigns to any sequence of partial functions of the same type a new such function. Its domain is the union of the domains of the sequence functions, and its value at any point is just the value of the first function in the sequence which is defined at that point. In this paper, the first-value operator is applied to establish hierarchies of classes of functions under various settings. For effective sequences of computable discrete functions, we obtain a hierarchy connected...

Hierarchies of function classes defined by the first-value operator

Armin Hemmerling (2007)

RAIRO - Theoretical Informatics and Applications

The first-value operator assigns to any sequence of partial functions of the same type a new such function. Its domain is the union of the domains of the sequence functions, and its value at any point is just the value of the first function in the sequence which is defined at that point. In this paper, the first-value operator is applied to establish hierarchies of classes of functions under various settings. For effective sequences of computable discrete functions, we obtain a hierarchy connected...

Hypersequents and fuzzy logic.

Dov Gabbay, George Metcalfe, Nicola Olivetti (2004)

RACSAM

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...

Interpreting reflexive theories in finitely many axioms

V. Shavrukov (1997)

Fundamenta Mathematicae

For finitely axiomatized sequential theories F and reflexive theories R, we give a characterization of the relation ’F interprets R’ in terms of provability of restricted consistency statements on cuts. This characterization is used in a proof that the set of ∏ 1 (as well as ∑ 1 ) sentences π such that GB interprets ZF+π is Σ 3 0 -complete.

L’autre axiome du choix

Pierre Ageron (2002)

Revue d'histoire des mathématiques

L’« axiome du choix simple » est le principe selon lequel on peut choisir un élément dans tout ensemble non vide. Cet « autre axiome du choix » a une histoire paradoxale et riche, dont la première partie de cet article recherche les traces et repère les enjeux. Apparaissent comme décisifs le statut de la théorie des ensembles dans les mathématiques intuitionnistes, mais aussi la tension croissante entre technicisation de la logique et réflexion épistémologique des mathématiciens. La deuxième partie...

Currently displaying 161 – 180 of 515