n - Infinite Forcing via Infinite Forcing
Na množinovú tému
Natural deduction and coherence for non-symmetric linearly distributive categories.
Natural deduction and sequent typed lambda calculus.
Natural dualities for varieties of distributive lattices with a quantifier
Natural limitations of decisions procedures for arithmetic with bounded quantifiers.
Natural Numbers In Illative Combinatory Logic.
Natural sums of ordinals
Natural well-orderings.
N-Dimensional Binary Vector Spaces
The binary set {0, 1} together with modulo-2 addition and multiplication is called a binary field, which is denoted by F2. The binary field F2 is defined in [1]. A vector space over F2 is called a binary vector space. The set of all binary vectors of length n forms an n-dimensional vector space Vn over F2. Binary fields and n-dimensional binary vector spaces play an important role in practical computer science, for example, coding theory [15] and cryptology. In cryptology, binary fields and n-dimensional...
Nearness relations in linear spaces
In this paper, we consider nearness-based convergence in a linear space, where the coordinatewise given nearness relations are aggregated using weighted pseudo-arithmetic and geometric means and using continuous t-norms.
Nearstandardness on a finite set [Book]
Negaciones en la teoría de conjuntos difusos.
All the negations of PL(X) satisfying the extension principle and the generalized extension principle are fully described through the negation of L. Necessary and sufficient conditions are given for n to be an ortho or u-complementation and for n to satisfy the DeMorgan laws.
Negation And Contradiction.
Negation operations definable on finite distributive lattices
Negative Modal Operators in Intuitionistic Logic
Negative modal operators in intuitionistic logic.
Negative universality results for graphs
It is shown that in many forcing models there is no universal graph at the successors of regular cardinals. The proof, which is similar to the well-known proof for Cohen forcing, is extended to show that it is consistent to have no universal graph at the successor of a singular cardinal, and in particular at . Previously, little was known about universality at the successors of singulars. Analogous results show it is consistent not just that there is no single graph which embeds the rest, but that...
Několik cest k minimalizaci výrokových forem
Několik poznámek k mohutnosti množin
Text je stručným přehledem nejdůležitějších vlastností nekonečných množin, mimo jiné vyvrací omyl publikovaný v článku Kuřina & Vondrová: Nekonečno, jak to vlastně je, UM 2003. "Zip Petera Zamarovského" není bijekcí mezi (0;1)x(0;1) a (0;1), ale pouze injekcí, tudíž ekvivalenci množiny všech bodů čtverce a úsečky nedokazuje. V článku je naznačen jiný důkaz.