排序方式: 共有199条查询结果,搜索用时 187 毫秒
111.
We explore in an experimental spirit the prospects for extending classical propositional logic with a new operator P intended to be interpreted when prefixed to a formula as saying that formula in question is at least partly true. The paradigm case of something which is, in the sense envisaged, false though still partly true is a conjunction one of whose conjuncts is false while the other is true. Ideally, we should like such a logic to extend classical logic – or any fragment thereof under consideration – conservatively, to be closed under uniform substitution (of arbitrary formulas for sentence letters or propositional variables), and to allow the substitutivity of provably equivalent formulas salva provabilitate. To varying degrees, we experience some difficulties only with this last (congruentiality) desideratum in the two four-valued logics we end up giving our most extended consideration to. 相似文献
112.
In a famous and controversial paper, B. H. Slater has argued against the possibility of paraconsistent logics. Our reply is centred on the distinction between two aspects of the meaning of a logical constant *c* in a given logic: its operational meaning, given by the operational rules for *c* in a cut-free sequent calculus for the logic at issue, and its global meaning, specified by the sequents containing *c* which can be proved in the same calculus. Subsequently, we use the same strategy to counter Quine's meaning variance argument against deviant logics. In a nutshell, we claim that genuine rivalry between (similar) logics *L* and *L* is possible whenever each constant in *L* has the same operational meaning as its counterpart in *L* although differences in global meaning arise in at least one case. 相似文献
113.
Riccardo Rosati 《Studia Logica》2001,69(1):171-191
We define a tableau calculus for the logic of only knowing and knowing at most ON, which is an extension of Levesque's logic of only knowing O. The method is based on the possible-world semantics of the logic ON, and can be considered as an extension of known tableau calculi for modal logic K45. From the technical viewpoint, the main features of such an extension are the explicit representation of "unreachable" worlds in the tableau, and an additional branch closure condition implementing the property that each world must be either reachable or unreachable. The calculus allows for establishing the computational complexity of reasoning about only knowing and knowing at most. Moreover, we prove that the method matches the worst-case complexity lower bound of the satisfiability problem for both ON and O. With respect to [22], in which the tableau calculus was originally presented, in this paper we both provide a formal proof of soundness and completeness of the calculus, and prove the complexity results for the logic ON. 相似文献
114.
We present a new prefixed tableau system for verification of validity in modal logic . The system is deterministic, it uniquely generates exactly one proof tree for each clausal representation of formulas, and, moreover, it uses some syntactic reductions of prefixes. is defined in the original methodology of tableau systems, without any external technique such as backtracking, backjumping, etc. Since all the necessary bookkeeping is built into the rules, the system is not only a basis for a validity algorithm, but is itself a decision procedure. We present also a deterministic tableau decision procedure which is an extension of and can be used for the global assumptions problem. 相似文献
115.
Constraints for Input/Output Logics 总被引:1,自引:0,他引:1
In a previous paper we developed a general theory of input/output logics. These are operations resembling inference, but where inputs need not be included among outputs, and outputs need not be reusable as inputs. In the present paper we study what happens when they are constrained to render output consistent with input. This is of interest for deontic logic, where it provides a manner of handling contrary-to-duty obligations. Our procedure is to constrain the set of generators of the input/output system, considering only the maximal subsets that do not yield output conflicting with a given input. When inputs are authorised to reappear as outputs, both maxichoice revision in the sense of Alchourrón/Makinson and the default logic of Poole emerge as special cases, and there is a close relation with Reiter default logic. However, our focus is on the general case where inputs need not be outputs. We show in what contexts the consistency of input with output may be reduced to its consistency with a truth-functional combination of components of generators, and under what conditions constrained output may be obtained by a derivation that is constrained at every step. 相似文献
116.
We consider substitutions in order sensitive situations, having in the back of our minds the case of dynamic predicate logic (DPL) with a stack semantics. We start from the semantic intuition that substitutions are move instructions on stacks: the syntactic operation [y/x] is matched by the instruction to move the value of the y-stack to the x-stack. We can describe these actions in the positive fragment of DPLE. Hence this fragment counts as a logic for DPL-substitutions. We give a calculus for the fragment and prove soundness and completeness. 相似文献
117.
Bruno Teheux 《Studia Logica》2007,87(1):13-36
In this paper, we develop a duality for the varieties of a Łukasiewicz
n + 1-valued modal system. This duality is an extension of Stone duality for modal algebras. Some logical consequences (such as completeness results, correspondence theory...) are then derived
and we propose some ideas for future research.
Presented by Daniele Mundici 相似文献
118.
Ion C. Baianu 《Axiomathes》2007,17(3-4):209-222
An overview of the following three related papers in this issue presents the Emergence of Highly Complex Systems such as living
organisms, man, society and the human mind from the viewpoint of the current Ontological Theory of Levels. The ontology of
spacetime structures in the Universe is discussed beginning with the quantum level; then, the striking emergence of the higher
levels of reality is examined from a categorical—relational and logical viewpoint. The ontological problems and methodology
aspects discussed in the first two papers are followed by a rigorous paper based on Category Theory, Algebraic Topology and
Logic that provides a conceptual and mathematical basis for a Categorical Ontology Theory of Levels. The essential links and
relationships between the following three papers of this issue are pointed out, and further possible developments are being
considered. 相似文献
119.
We examine the notion of conditionals and the role of conditionals in inductive logics and arguments. We identify three mistakes commonly made in the study of, or motivation for, non-classical logics. A nonmonotonic consequence relation based on evidential probability is formulated. With respect to this acceptance relation some rules of inference of System P are unsound, and we propose refinements that hold in our framework. 相似文献
120.
In the 1970s, Robin Giles introduced a game combining Lorenzen-style dialogue rules with a simple scheme for betting on the
truth of atomic statements, and showed that the existence of winning strategies for the game corresponds to the validity of
formulas in Łukasiewicz logic. In this paper, it is shown that ‘disjunctive strategies’ for Giles’s game, combining ordinary
strategies for all instances of the game played on the same formula, may be interpreted as derivations in a corresponding
proof system. In particular, such strategies mirror derivations in a hypersequent calculus developed in recent work on the
proof theory of Łukasiewicz logic.
Presented by Daniele Mundici 相似文献