Sätze über Determinanten und Anwendung derselben zum Beweise der Sätze von Pascal und Brianchon.
Page 1 Next
Displaying 1 – 20 of 32
Second order arithmetic and autonomous computability.
Gajlit, E. V. (2003)
Sibirskij Matematicheskij Zhurnal
Second order arithmetic and pulsating hierarchies.
Gajlit, E.V. (2002)
Sibirskij Matematicheskij Zhurnal
Sémantique catégorique des types : comprendre le système F
Pierre Argeron (1988)
Diagrammes
Semisemiological structure of the prime numbers and conditional Goldbach theorems.
H.A. Pogorzelski (1977)
Journal für die reine und angewandte Mathematik
Separatedness in constructive topology.
Bridges, Douglas, Vîţă, Luminiţa (2003)
Documenta Mathematica
Sequent Calculus, Derivability, Provability. Gödel's Completeness Theorem
Marco Caminati (2011)
Formalized Mathematics
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...
Shiftings of the horizon
Antonín Sochor, Petr Vopěnka (1983)
Commentationes Mathematicae Universitatis Carolinae
Simultane Rekursionen in der Theorie der Funktionale endlicher Typen.
Kurt Schütte, Justus Diller (1971)
Archiv für mathematische Logik und Grundlagenforschung
Solution to a problem of Gandy's
Stephen Leeds, Hilary Putnam (1974)
Fundamenta Mathematicae
Solving intuitionistic fuzzy multi-objective linear programming problem and its application in supply chain management
Hassan Hassanpour, Elham Hosseinzadeh, Mahsa Moodi (2023)
Applications of Mathematics
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....
Some combinatorics involving ξ-large sets
Teresa Bigorajska, Henryk Kotlarski (2002)
Fundamenta Mathematicae
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.
Some comments on the paper by Artigue, Isambert, Perrin and Zalc
W. Marek (1978)
Fundamenta Mathematicae
Some constructive topological properties of function spaces
Maurice Margenstern (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Some diophantine forms of Gödel's theorem.
V.H. Dyson, J.P. Jones (1982)
Archiv für mathematische Logik und Grundlagenforschung
Some remarks on bicommutability
M. Artigue, E. Isambert, M. Perrin, A. Zalc (1978)
Fundamenta Mathematicae
Some simple decidability proofs
M. Kapetanović (1983)
Matematički Vesnik
Speed-up for propositional Frege systems via generalizations of proofs
Jan Krajíček (1989)
Commentationes Mathematicae Universitatis Carolinae
Spielquantorinterpretationen unstetiger Funktionale der höheren Analysis.
Wolfgang Friedrich (1984)
Archiv für mathematische Logik und Grundlagenforschung
Společný spůsob dokazování různých pouček a vzorců. [I.]
Cornelius Plch (1881)
Časopis pro pěstování mathematiky a fysiky
Currently displaying 1 – 20 of 32
Page 1 Next