排序方式: 共有67条查询结果,搜索用时 31 毫秒
31.
Michael Tiomkin 《Journal of Applied Logic》2013,11(4):530-535
We introduce a sequent calculus that is sound and complete with respect to propositional contingencies, i.e., formulas which are neither provable nor refutable. Like many other sequent and natural deduction proof systems, this calculus possesses cut elimination and the subformula property and has a simple proof search mechanism. 相似文献
32.
In this paper we introduce a paraconsistent reasoning strategy, Chunk and Permeate. In this, information is broken up into chunks, and a limited amount of information is allowed to flow between chunks. We start by giving an abstract characterisation of the strategy. It is then applied to model the reasoning employed in the original infinitesimal calculus. The paper next establishes some results concerning the legitimacy of reasoning of this kind – specifically concerning the preservation of the consistency of each chunk – and concludes with some other possible applications and technical questions. 相似文献
33.
Norihiro Kamide 《Studia Logica》2005,80(2-3):265-289
A general Gentzen-style framework for handling both bilattice (or strong) negation and usual negation is introduced based
on the characterization of negation by a modal-like operator. This framework is regarded as an extension, generalization or
re- finement of not only bilattice logics and logics with strong negation, but also traditional logics including classical
logic LK, classical modal logic S4 and classical linear logic CL. Cut-elimination theorems are proved for a variety of proposed
sequent calculi including CLS (a conservative extension of CL) and CLScw (a conservative extension of some bilattice logics, LK and S4). Completeness theorems are given for these calculi with respect
to phase semantics, for SLK (a conservative extension and fragment of LK and CLScw, respectively) with respect to a classical-like semantics, and for SS4 (a conservative extension and fragment of S4 and CLScw,
respectively) with respect to a Kripke-type semantics. The proposed framework allows for an embedding of the proposed calculi
into LK, S4 and CL. 相似文献
34.
We introduce necessary and sufficient conditions for a (single-conclusion) sequent calculus to admit (reductive) cut-elimination.
Our conditions are formulated both syntactically and semantically. 相似文献
35.
The phenomenological calculus is a relational paradigm for complex systems, closely related in substance and spirit to Robert
Rosen’s own approach. Its mathematical language is multilinear algebra. The epistemological exploration continues in this
paper, with the expansion of the phenomenological calculus into the realm of anisotropy. 相似文献
36.
37.
38.
39.
40.
Ulrich Berger Stefan Berghofer Pierre Letouzey Helmut Schwichtenberg 《Studia Logica》2006,82(1):25-49
This paper describes formalizations of Tait's normalization proof for the simply typed λ-calculus in the proof assistants
Minlog, Coq and Isabelle/HOL. From the formal proofs programs are machine-extracted that implement variants of the well-known
normalization-by-evaluation algorithm. The case study is used to test and compare the program extraction machineries of the
three proof assistants in a non-trivial setting. 相似文献