排序方式: 共有199条查询结果,搜索用时 15 毫秒
91.
92.
《Journal of Applied Logic》2014,12(4):570-583
One of natural combinations of Kripke complete modal logics is the product, an operation that has been extensively investigated over the last 15 years. In this paper we consider its analogue for arbitrary modal logics: to this end, we use product-like constructions on general frames and modal algebras. This operation was first introduced by Y. Hasimoto in 2000; however, his paper remained unnoticed until recently. In the present paper we quote some important Hasimoto's results, and reconstruct the product operation in an algebraic setting: the Boolean part of the resulting modal algebra is exactly the tensor product of original algebras (regarded as Boolean rings). Also, we propose a filtration technique for Kripke models based on tensor products and obtain some decidability results. 相似文献
93.
94.
Rudolf A. Treumann 《World Futures: Journal of General Evolution》2013,69(1):47-53
The term globalization is questioned in its validity and applicability to structures other than verbal. Globalization is a historical term which changes its meaning with time and culture. It is not only that its content changes but the validity of a globalization concept changes with the historical perspective. Morever, solution of global problems depends heavily on the correct analysis of the problem. Without such an analysis there is no possibility to find even an approximate solution. Hence, predictability is impossible. There is no trend which is sufficiently long to make any reliable prediction for global problems other than the most simple ones. 相似文献
95.
Elia Zardini 《Studia Logica》2008,90(3):337-368
According to the naive theory of vagueness, the vagueness of an expression consists in the existence of both positive and
negative cases of application of the expression and in the non-existence of a sharp cut-off point between them. The sorites
paradox shows the naive theory to be inconsistent in most logics proposed for a vague language. The paper explores the prospects
of saving the naive theory by revising the logic in a novel way, placing principled restrictions on the transitivity of the
consequence relation. A lattice-theoretical framework for a whole family of (zeroth-order) “tolerant logics” is proposed and
developed. Particular care is devoted to the relation between the salient features of the formal apparatus and the informal
logical and semantic notions they are supposed to model. A suitable non-transitive counterpart to classical logic is defined.
Some of its properties are studied, and it is eventually shown how an appropriate regimentation of the naive theory of vagueness
is consistent in such a logic. 相似文献
96.
According to Suszko’s Thesis, there are but two logical values, true and false. In this paper, R. Suszko’s, G. Malinowski’s,
and M. Tsuji’s analyses of logical twovaluedness are critically discussed. Another analysis is presented, which favors a notion
of a logical system as encompassing possibly more than one consequence relation.
Presented by Jacek Malinowski 相似文献[13, p. 281]
97.
Algebraic Aspects of Cut Elimination 总被引:2,自引:2,他引:0
We will give here a purely algebraic proof of the cut elimination theorem for various sequent systems. Our basic idea is to introduce mathematical structures, called Gentzen structures, for a given sequent system without cut, and then to show the completeness of the sequent system without cut with respect to the class of algebras for the sequent system with cut, by using the quasi-completion of these Gentzen structures. It is shown that the quasi-completion is a generalization of the MacNeille completion. Moreover, the finite model property is obtained for many cases, by modifying our completeness proof. This is an algebraic presentation of the proof of the finite model property discussed by Lafont [12] and Okada-Terui [17]. 相似文献
98.
This paper concerns a (prospective) goal directed proof procedure for the propositional fragment of the inconsistency-adaptive logic ACLuN1. At the propositional level, the procedure forms an algorithm for final derivability. If extended to the predicative level, it provides a criterion for final derivability. This is essential in view of the absence of a positive test. The procedure may be generalized to all flat adaptive logics. 相似文献
99.
Dimiter Vakarelov 《Studia Logica》2005,80(2-3):393-430
Constructive logic with Nelson negation is an extension of the intuitionistic logic with a special type of negation expressing some features of constructive falsity and refutation by counterexample. In this paper we generalize this logic weakening maximally the underlying intuitionistic negation. The resulting system, called subminimal logic with Nelson negation, is studied by means of a kind of algebras called generalized N-lattices. We show that generalized N-lattices admit representation formalizing the intuitive idea of refutation by means of counterexamples giving in this way a counterexample semantics of the logic in question and some of its natural extensions. Among the extensions which are near to the intuitionistic logic are the minimal logic with Nelson negation which is an extension of the Johansson's minimal logic with Nelson negation and its in a sense dual version — the co-minimal logic with Nelson negation. Among the extensions near to the classical logic are the well known 3-valued logic of Lukasiewicz, two 12-valued logics and one 48-valued logic. Standard questions for all these logics — decidability, Kripke-style semantics, complete axiomatizability, conservativeness are studied. At the end of the paper extensions based on a new connective of self-dual conjunction and an analog of the Lukasiewicz middle value ½ have also been considered. 相似文献
100.
Sergei P. Odintsov 《Studia Logica》2005,80(2-3):291-320
The article is devoted to the systematic study of the lattice εN4⊥ consisting of logics extending N4⊥. The logic N4⊥ is obtained from paraconsistent Nelson logic N4 by adding the new constant ⊥ and axioms ⊥ → p, p → ∼ ⊥. We study interrelations between εN4⊥ and the lattice of superintuitionistic logics. Distinguish in εN4⊥ basic subclasses of explosive logics, normal logics, logics of general form and study how they are relate.
The author acknowledges support by the Alexander von Humboldt-Stiftung and by Counsil for Grants under RF President, project
NSh - 2112.2003.1. 相似文献