Negation And Contradiction.
Negative Modal Operators in Intuitionistic Logic
Negative modal operators in intuitionistic logic.
Několik cest k minimalizaci výrokových forem
New applications of the wreath product of forest algebras
We give several new applications of the wreath product of forest algebras to the study of logics on trees. These include new simplified proofs of necessary conditions for definability in CTL and first-order logic with the ancestor relation; a sequence of identities satisfied by all forest languages definable in PDL; and new examples of languages outside CTL, along with an application to the question of what properties are definable in both CTL and LTL.
New constructions of uni-nullnorms on certain classes of bounded lattices by closure (interior) operators
The primary aim of this article is to put forward new classes of uni-nullnorms on certain classes of bounded lattices via closure (interior) operators. Due to the new classes of uninorms combining both a t-norm and a t-conorm by various kinds of closure operators or interior operators, the relationships and properties among the same class of uninorms on , we obtain new classes of uni-nullnorms on via closure (interior) operators. The constructions of uni-nullnorms on some certain classes...
New kinds of hybrid filters of EQ-algebras
The main goal of this paper is to introduce hybrid positive implicative and hybrid implicative (pre)filters of EQ-algebras. In the following, some characterizations of this hybrid (pre)filters are investigated and it is proved that the quotient algebras induced by hybrid positive implicative filters in residuated EQ-algebras are idempotent and residuated EQ-algebra. Moreover, the relationship between hybrid implicative prefilters and hybrid positive implicative prefilters are discussed and it is...
Nice local global fields. IV.
Nichtaxiomatisierbarkeit von Satzmengen durch Ausdrücke spezieller Gestalt
Niven’s Theorem
This article formalizes the proof of Niven’s theorem [12] which states that if x/π and sin(x) are both rational, then the sine takes values 0, ±1/2, and ±1. The main part of the formalization follows the informal proof presented at Pr∞fWiki (https://proofwiki.org/wiki/Niven’s_Theorem#Source_of_Name). For this proof, we have also formalized the rational and integral root theorems setting constraints on solutions of polynomial equations with integer coefficients [8, 9].
Non additive ordinal relations representable by lower or upper probabilities
We characterize (in terms of necessary and sufficient conditions) binary relations representable by a lower probability. Such relations can be non- additive (as the relations representable by a probability) and also not “partially monotone” (as the relations representable by a belief function). Moreover we characterize relations representable by upper probabilities and those representable by plausibility. In fact the conditions characterizing these relations are not immediately deducible by means...
Non-axiomatizability of real general affine geometry
Nondeterminism and fully abstract models
Non-finitizability of a weak second-order theory
Normal forms in partial modal logic
A "partial" generalization of Fine's definition [Fin] of normal forms in normal minimal modal logic is given. This means quick access to complete axiomatizations and decidability proofs for partial modal logic [Thi].
Normal forms in the typed -calculus with tuple types
Normal Subgroup of Product of Groups
In [6] it was formalized that the direct product of a family of groups gives a new group. In this article, we formalize that for all j ∈ I, the group G = Πi∈IGi has a normal subgroup isomorphic to Gj. Moreover, we show some relations between a family of groups and its direct product.
Normalisation of the theory of Cartesian closed categories and conservativity of extensions of
Normalisation of the Theory T of Cartesian Closed Categories and Conservativity of Extensions T[x] of T
Using an inductive definition of normal terms of the theory of Cartesian Closed Categories with a given graph of distinguished morphisms, we give a reduction free proof of the decidability of this theory. This inductive definition enables us to show via functional completeness that extensions of such a theory by new constants (“indeterminates”) are conservative.
Notational and Logical Completeness in three-Valued Logic