scholarly journals The Quantum Completeness Problem

10.5772/33279 ◽  
2012 ◽  
Author(s):  
Carsten Held
Keyword(s):  
Completeness Problem

Human reasoning includes a mental logic

2009 ◽  
Vol 32 (1) ◽  
pp. 96-97 ◽  
Author(s):  
David P. O'Brien
Keyword(s):  
Probability Theory ◽  
Human Reasoning ◽  
Completeness Problem ◽  
Mental Logic

AbstractOaksford & Chater (O&C) have rejected logic in favor of probability theory for reasons that are irrelevant to mental-logic theory, because mental-logic theory differs from standard logic in significant ways. Similar to O&C, mental-logic theory rejects the use of the material conditional and deals with the completeness problem by limiting the scope of its procedures to local sets of propositions.

scholarly journals KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS

2019 ◽  
Vol 84 (02) ◽  
pp. 533-588 ◽  
Author(s):  
STANISLAV KIKOT ◽  
AGI KURUCZ ◽  
YOSHIHITO TANAKA ◽  
FRANK WOLTER ◽  
MICHAEL ZAKHARYASCHEV
Keyword(s):  
Computer Science ◽  
Monotone Operators ◽  
Modal Logics ◽  
Consequence Relations ◽  
First Order ◽  
Completeness Problem ◽  
Relational Structures ◽  
Kripke Frames

AbstractOur concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal diamond operators. Originated in logic, algebra and computer science, spi-logics have two natural semantics: meet-semilattices with monotone operators providing Birkhoff-style calculi and first-order relational structures (aka Kripke frames) often used as the intended structures in applications. Here we lay foundations for a completeness theory that aims to answer the question whether the two semantics define the same consequence relations for a given spi-logic.

scholarly journals The completeness problem in partial hyperclones

2006 ◽  
Vol 306 (13) ◽  
pp. 1405-1414 ◽  
Author(s):  
B.A. Romov
Keyword(s):  
Completeness Problem

Resonance state completeness problem for quantum graph

2017 ◽  
Author(s):  
Anton I. Popov ◽  
Igor Y. Popov ◽  
Dmitry A. Gerasimov
Keyword(s):  
Resonance State ◽  
Quantum Graph ◽  
Completeness Problem

scholarly journals A restricted shift completeness problem

2012 ◽  
Vol 263 (7) ◽  
pp. 1887-1893 ◽  
Author(s):  
Anton Baranov ◽  
Yurii Belov ◽  
Alexander Borichev
Keyword(s):  
Completeness Problem ◽  
Restricted Shift

scholarly journals Completeness problem of multidimensional tessellation automata

1977 ◽  
Vol 35 (1) ◽  
pp. 52-86 ◽  
Author(s):  
Akira Maruoka ◽  
Masayuki Kimura
Keyword(s):  
Completeness Problem

NONDETERMINISM ANALYSIS ON SUPERCOMPUTERS AND CLUSTERS

2001 ◽  
Vol 11 (02n03) ◽  
pp. 251-266
Author(s):  
DIETER KRANZLMÜLLER
Keyword(s):  
Computational Grids ◽  
Science And Engineering ◽  
Software Developers ◽  
Computing Power ◽  
Completeness Problem ◽  
Critical Issues ◽  
Computational Science And Engineering ◽  
The Impact ◽  
Memory Constraints ◽  
Nondeterministic Program

Interconnecting computers into clusters or computational grids promises many benefits for users of computational science and engineering, especially in terms of performance and costs. This situation is additionally supported by programming libraries like MPI and PVM, which are portable across different platforms and allow to exploit the available computing power. Consequently, the number of applications utilizing these computing structures is steadily increasing. Yet, there are also some pitfalls with possibly serious consequences, that must not be ignored by software developers. This paper describes some critical issues related to nondeterministic program behavior. With such kinds of programs different program executions are observed although the same input data are provided, leading to the irreproducibility effect, the completeness problem, and the probe effect. The impact of these effects, their weight for software developers, and how they are affected on supercomputer architectures and cluster environments are discussed. These critical issues need to be pointed out to users in order to raise their understanding and awareness of the problems. While the irreproducibility effect is believed to be sufficiently solved by record&replay mechanisms, existing solutions for the probe effect are only partially successful, and only very few approaches address the completeness problem. A simple solution for the latter is offered by automatic event manipulation and artificial replay, which is however restricted by time and memory constraints. In addition, this solution to the completeness problem also solves the probe effect in nondeterministic parallel programs.

A remark on free choice sequences and the topological completeness proofs

1958 ◽  
Vol 23 (4) ◽  
pp. 369-388 ◽  
Author(s):  
G. Kreisel
Keyword(s):  
Free Choice ◽  
Classical System ◽  
Weak Sense ◽  
Predicate Calculus ◽  
The Novel ◽  
Completeness Problem

Below are collected some simple results on the theory of free choice sequences [4] or infinitely proceeding sequences (ips) as they are called in [5]. These results are not sufficient to settle the completeness problems for Heyting's predicate calculus [4], as formulated in [12], neither in the strong nor in the weak sense. They are published because they lead to intuitionistically valid versions of completeness proofs which have appeared in the literature, particularly [16], [17], [18], and, with certain reservations, [1].The problems considered below (except in §8) differ from those of [12] in the following respect: In [12] we were mainly concerned with formulae of Heyting's predicate calculus which were not even classically provable, and showed that the calculus was complete with respect to certain classes of these formulae. The novel feature was that we established this completeness by means of intuitionistically valid methods, in fact methods which can be formalized in Heyting's arithmetic. Here we are primarily concerned with formulae which are classically, but not intuitionistically, provable. As pointed out in [12], the nature of the completeness problem for such formulae is totally different: the class of predicates which provides the required counterexamples must come from a system (with an intuitionistically acceptable interpretation) which, unlike Heyting's arithmetic, is not a subsystem of the corresponding classical system. An example of such a system is an extension FC, given below, of Heyting's formalization of the theory of free choices.

Sign in / Sign up

Export Citation Format

Share Document