infinitary
Look at other dictionaries:
infinitary — infinˈitary adjective Relating to infinity • • • Main Entry: ↑infinite * * * infinitary, a. Math. (ɪnˈfɪnɪtərɪ) [= Ger. infinitär, as in infinitärkalkul ‘infinitary calculus’ (Du Bois Raymond): see ary1.] Relating to infinity, or to an infinite… … Useful english dictionary
Infinitary logic — Those unfamiliar with mathematical logic or the concept of ordinals are advised to consult those articles first. An infinitary logic is a logic that allows infinitely long statements and/or infinitely long proofs. Some infinitary logics may have… … Wikipedia
Infinitary combinatorics — In mathematics, infinitary combinatorics, or combinatorial set theory, is an extension of ideas in combinatorics to infinite sets. Some of the things studied include continuous graphs and trees, extensions of Ramsey s theorem, and Martin s axiom … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Finitary — In mathematics or logic, a finitary operation is one, like those of arithmetic, that takes a finite number of input values to produce an output. An operation such as taking an integral of a function, in calculus, is defined in such a way as to… … Wikipedia
Combinatorics — is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size (enumerative combinatorics), deciding when certain criteria can be met,… … Wikipedia
Barwise compactness theorem — In mathematical logic, the Barwise compactness theorem, named after Jon Barwise, is a generalization of the usual compactness theorem for first order logic to a certain class of infinitary languages. It was stated and proved by Barwise in… … Wikipedia
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
Union (set theory) — Union of two sets … Wikipedia
