Some remarks about the connections between combinatory logic and axiomatic recursion theory.
Some Remarks on Reproductive Solutions
Some remarks on the consequence operation in sentential logics
Some remarks on well-ordered models
Some results on complexity of μ-calculus evaluation in the black-box model
We consider μ-calculus formulas in a normal form: after a prefix of fixed-point quantifiers follows a quantifier-free expression. We are interested in the problem of evaluating (model checking) such formulas in a powerset lattice. We assume that the quantifier-free part of the expression can be any monotone function given by a black-box – we may only ask for its value for given arguments. As a first result we prove that when the lattice is fixed, the problem becomes polynomial (the assumption about...
Some results on the weak dominance relation between ordered weighted averaging operators and T-norms
Aggregation operators have the important application in any fields where the fusion of information is processed. The dominance relation between two aggregation operators is linked to the fusion of fuzzy relations, indistinguishability operators and so on. In this paper, we deal with the weak dominance relation between two aggregation operators which is closely related with the dominance relation. Weak domination of isomorphic aggregation operators and ordinal sum of conjunctors is presented. More...
Some simple decidability proofs
Some Theorems For Model Theory Of Mixed-Valued Predicate Calculi
Some undecidable theories with monadic predicates and without equality.
Současný stav ve výzkumu základů matematiky
Souslin-Klееnе does not imply Beth
Specifying t-norms based on the value of T (1/2, 1/2).
We study here the behavior of the t-norms at the point (1/2, 1/2). We indicate why this point can be considered as significant in the specification of t-norms. Then, we suggest that the image of this point can be used to classify the t-norms. We consider some usual examples. We also study the case of parameterized t-norms. Finally using the results of this study, we propose a uniform method of computing the parameters. This method allows not only having the same parameter-scale for all the families,...
Speed-up for propositional Frege systems via generalizations of proofs
Splitting lattices of logics.
Stable surjection logic
States of affairs as values for formulas
States on pseudo-effect algebras with general comparability
Statistical approach to proof theory
Statistical deducibility testing with stochastic parameters
Statistical estimation of deducibility in polyadic algebras