An axiomatization of extensional probability measures
An explicit basis for the admissible inference rules in the Gödel-Löb logic GL.
An explicit basis for the admissible inference rules of the modal logics extending S4.1 and Grz.
An extension method for t-norms on subintervals to t-norms on bounded lattices
In this paper, a construction method on a bounded lattice obtained from a given t-norm on a subinterval of the bounded lattice is presented. The supremum distributivity of the constructed t-norm by the mentioned method is investigated under some special conditions. It is shown by an example that the extended t-norm on from the t-norm on a subinterval of need not be a supremum-distributive t-norm. Moreover, some relationships between the mentioned construction method and the other construction...
An extension of the Kreisel-Putman system.
An extension of the ordering based on nullnorms
In this paper, we generally study an order induced by nullnorms on bounded lattices. We investigate monotonicity property of nullnorms on bounded lattices with respect to the -partial order. Also, we introduce the set of incomparable elements with respect to the F-partial order for any nullnorm on a bounded lattice. Finally, we investigate the relationship between the order induced by a nullnorm and the distributivity property for nullnorms.
An extension of the probability logic
An ILP model for a monotone graded classification problem
Motivation for this paper are classification problems in which data can not be clearly divided into positive and negative examples, especially data in which there is a monotone hierarchy (degree, preference) of more or less positive (negative) examples. We present a new formulation of a fuzzy inductive logic programming task in the framework of fuzzy logic in narrow sense. Our construction is based on a syntactical equivalence of fuzzy logic programs FLP and a restricted class of generalised annotated...
An implementation of the induction rule into resolution procedures for automatic theorem proving.
An inheritance criterion for the admissible inference rules of K4.
An inquiry-based method for Choquet integral-based aggregation of interface usability parameters
The concept of usability of man-machine interfaces is usually judged in terms of a number of aspects or attributes that are known to be subject to some rough correlations, and that are in many cases given different importance, depending on the context of use of the application. In consequence, the automation of judgment processes regarding the overall usability of concrete interfaces requires the design of aggregation operators that are capable of modeling approximate or ill-defined interactions...
An intensional approach to questions
An introduction to algorithmic logic. Metamathematical investigations in the theory of programs
An intuitionistic logic with probablistic operators.
An investigation on the -fold IVRL-filters in triangle algebras
The present study aimed to introduce -fold interval valued residuated lattice (IVRL for short) filters in triangle algebras. Initially, the notions of -fold (positive) implicative IVRL-extended filters and -fold (positive) implicative triangle algebras were defined. Afterwards, several characterizations of the algebras were presented, and the correlations between the -fold IVRL-extended filters, -fold (positive) implicative algebras, and the Gödel triangle algebra were discussed.
An upper bound on the space complexity of random formulae in resolution
We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in -CNF on variables and clauses is .
An Upper Bound on the Space Complexity of Random Formulae in Resolution
We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in k-CNF on n variables and m = Δn clauses is .
Annihilators and deductive systems in commutative Hilbert algebras
The properties of deductive systems in Hilbert algebras are treated. If a Hilbert algebra considered as an ordered set is an upper semilattice then prime deductive systems coincide with meet-irreducible elements of the lattice of all deductive systems on and every maximal deductive system is prime. Complements and relative complements of are characterized as the so called annihilators in .
Annihilators in BCK-algebras
We introduce the concepts of an annihilator and a relative annihilator of a given subset of a BCK-algebra . We prove that annihilators of deductive systems of BCK-algebras are again deductive systems and moreover pseudocomplements in the lattice of all deductive systems on . Moreover, relative annihilators of with respect to are introduced and serve as relative pseudocomplements of w.r.t. in .
Anzahlquantoren in der Prädikatenlogik