Sätze über Determinanten und Anwendung derselben zum Beweise der Sätze von Pascal und Brianchon.
Fifth of a series of articles laying down the bases for classical first order model theory. This paper presents multiple themes: first it introduces sequents, rules and sets of rules for a first order language L as L-dependent types. Then defines derivability and provability according to a set of rules, and gives several technical lemmas binding all those concepts. Following that, it introduces a fixed set D of derivation rules, and proceeds to convert them to Mizar functorial cluster registrations...
The aim of this paper is solving an intuitionistic fuzzy multi-objective linear programming problem containing intuitionistic fuzzy parameters, intuitionistic fuzzy maximization/minimization, and intuitionistic fuzzy constraints. To do this, a linear ranking function is used to convert the intuitionistic fuzzy parameters to crisp ones first. Then, linear membership and non-membership functions are used to manipulate intuitionistic fuzzy maximization/minimization and intuitionistic fuzzy constraints....
We prove a version of the Ramsey theorem for partitions of (increasing) n-tuples. We derive this result from a version of König's infinity lemma for ξ-large trees. Here ξ < ε₀ and the notion of largeness is in the sense of Hardy hierarchy.