排序方式: 共有127条查询结果,搜索用时 15 毫秒
11.
12.
13.
William Craig 《Synthese》2008,164(3):321-332
A common aim of elimination problems for languages of logic is to express the entire content of a set of formulas of the language,
or a certain part of it, in a way that is more elementary or more informative. We want to bring out that as the languages
for logic grew in expressive power and, at the same time, our knowledge of their expressive limitations also grew, elimination
problems in logic underwent some change. For languages other than that for monadic second-order logic, there remain important
open problems. 相似文献
14.
David J. Foulis 《Studia Logica》2006,84(3):407-424
A Heyting effect algebra (HEA) is a lattice-ordered effect algebra that is at the same time a Heyting algebra and for which the Heyting center coincides
with the effect-algebra center. Every HEA is both an MV-algebra and a Stone-Heyting algebra and is realized as the unit interval
in its own universal group. We show that a necessary and sufficient condition that an effect algebra is an HEA is that its
universal group has the central comparability and central Rickart properties.
Presented by Daniele Mundici 相似文献
15.
MV-Algebras and Quantum Computation 总被引:2,自引:1,他引:1
We introduce a generalization of MV algebras motivated by the investigations into the structure of quantum logical gates.
After laying down the foundations of the structure theory for such quasi-MV algebras, we show that every quasi-MV algebra is embeddable into the direct product of an MV algebra and a “flat” quasi-MV
algebra, and prove a completeness result w.r.t. a standard quasi-MV algebra over the complex numbers.
Presented by Heinrich Wansing 相似文献
16.
Paulo A. S. Veloso Renata P. de Freitas Petrucio Viana Mario Benevides Sheila R. M. Veloso 《Journal of Philosophical Logic》2007,36(5):489-509
We compare fork arrow logic, an extension of arrow logic, and its natural first-order counterpart (the correspondence language)
and show that both have the same expressive power. Arrow logic is a modal logic for reasoning about arrow structures, its
expressive power is limited to a bounded fragment of first-order logic. Fork arrow logic is obtained by adding to arrow logic
the fork modality (related to parallelism and synchronization). As a result, fork arrow logic attains the expressive power
of its first-order correspondence language, so both can express the same input–output behavior of processes. 相似文献
17.
Paul Hovda 《Journal of Philosophical Logic》2009,38(1):55-82
Classical mereology is a formal theory of the part-whole relation, essentially involving a notion of mereological fusion,
or sum. There are various different definitions of fusion in the literature, and various axiomatizations for classical mereology.
Though the equivalence of the definitions of fusion is provable from axiom sets, the definitions are not logically equivalent,
and, hence, are not inter-changeable when laying down the axioms. We examine the relations between the main definitions of
fusion and correct some technical errors in prominent discussions of the axiomatization of mereology. We show the equivalence
of four different ways to axiomatize classical mereology, using three different notions of fusion. We also clarify the connection
between classical mereology and complete Boolean algebra by giving two “neutral” axiom sets which can be supplemented by one
or the other of two simple axioms to yield the full theories; one of these uses a notion of “strong complement” that helps
explicate the connections between the theories. 相似文献
18.
Execution architectures for program algebra 总被引:2,自引:0,他引:2
We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purpose of explanation and provided with a process-algebraic, compositional semantics, and synthetic architectures, focusing on how a program may be a physical part of an execution architecture. Then we discuss in detail the Turing machine, a well-known example of an analytic architecture. The logical core of the halting problem—the inability to forecast termination behavior of programs—leads us to a few approaches and examples on related issues: forecasters and rational agents. In particular, we consider architectures suitable to run a Newcomb Paradox system and the Prisoner's Dilemma. 相似文献
19.
Yoshihito Tanaka 《Studia Logica》2007,86(1):111-131
It is known that for any subdirectly irreducible finite Heyting algebra A and any Heyting algebra B, A is embeddable into a quotient algebra of B, if and only if Jankov’s formula χ
A
for A is refuted in B. In this paper, we present an infinitary extension of the above theorem given by Jankov. More precisely, for any cardinal
number κ, we present Jankov’s theorem for homomorphisms preserving infinite meets and joins, a class of subdirectly irreducible
complete κ-Heyting algebras and κ-infinitary logic, where a κ-Heyting algebra is a Heyting algebra A with # ≥ κ and κ-infinitary
logic is the infinitary logic such that for any set Θ of formulas with # Θ ≥ κ, ∨Θ and ∧Θ are well defined formulas. 相似文献
20.
An algebra A is said to be congruence coherent if every subalgebra of A that contains a class of some congruence on A is a union of -classes. This property has been investigated in several varieties of lattice-based algebras. These include, for example,
de Morgan algebras, p-algebras, double p-algebras, and double MS-algebras. Here we determine precisely when the property holds in the class of symmetric extended
de Morgan algebras.
Presented by M.E. Adams 相似文献