نتایج جستجو برای: without logical contradictions thus

تعداد نتایج: 1471904  

1998
Angelo Bassi GianCarlo Ghirardi

With reference to a particular example, we prove that the Decoherent Histories approach to Quantum Mechanics meets logical contradictions unless one drastically limits the allowed decoherent families. Our proof follows a line of reasoning different from the one of anologous criticisms which have been put forward recently; due to its different logical structure, it cannot be rejected on the basi...

2010
Timothy L. Hinrichs Jui-Yi Kao Michael R. Genesereth

This paper presents the core algorithm for a tool implementing a declarative approach to web form development. Instead of writing Javascript to implement error detection and implied value computation, web developers write an ontology in classical logic that describes the relationships between web form fields, and the Javascript is generated automatically. To meet performance demands, the compil...

Journal: :Journal of Indian Philosophy 2023

Abstract Dharmakīrti argues that there is no pramāṇa (valid means of cognition or source knowledge) for a thesis self-contradiction ( svavacanavirodha ). That is, self-contradictions such as ‘everything said false’ and ‘my mother barren’ cannot be known to true false. The contemporary scholar Tillemans challenges by arguing we can know are false formal logical inference. aims the paper answer T...

2016
Frederic Dambreville

When implementing the DSmT, a difficulty may arise from the possible huge dimension of hyper-power sets, which are indeed free structures. However, it is possible to reduce the dimension of these structures by involving logical constraints. In this chapter, the logical constraints will be related to a predefined order over the logical propositions. The use of such orders and their resulting log...

2007

Dialetheism is the claim that some contradictions are true. For anyone trained in standard logic and raised in the belief that already in antiquity Aristotle settled once and for all that there is the Law of Non-Contradiction dialetheism sounds not just false, but bizarre. On the other hand people contradict each other quite often and a couple of theories have turned out to be inconsistent. Nev...

2001
DANIEL N. OSHERSON ELLEN MARKMAN Daniel N. Osherson Ellen Markman

Children were found to experience difficulty evaluating contradictions of the form p 6 -p, and tautologies of the form p v -p. It was hypothesized that (a) the difficulty of these statements was not due solely to the logical words occurring in them, (6) part of the difficulty is due to the fhct that their truth value derives from their linguistic f&-m rather than from empirical considerations, ...

2008
Walter Philipp

We discuss a class of proofs of Bell-type inequalities that are based on tables of potential outcomes. These proofs state in essence: if one can only imagine (or write down in a table) the potential outcome of a hidden parameter model for EPR experiments then a contradiction to experiment and quantum mechanics follows. We show that these proofs do not contain hidden variables that relate to tim...

2003
Stefan Schlobach Ronald Cornet

Current Description Logic reasoning systems provide only limited support for debugging logically erroneous knowledge bases. In this paper we propose new non-standard reasoning services which we designed and implemented to pinpoint logical contradictions when developing the medical terminology DICE. We provide complete algorithms for unfoldable ACC-TBoxes based on minimisation of axioms using Bo...

2001
Enric Trillas Eloy Renedo Sergio Guadarrama

To avoid self-contradictions in Fuzzy Set Theory, it is needed to consider only fuzzy sets that are not selfcontradictory and whose complements are also not selfcontradictory. This paper deals with a subset Fnc(E) in [0, 1] , where the above conditions are satisfied. A particular Fuzzy Set Theory is defined in Fnc(E) with adequate logical connectives. Finally, which classical properties hold in...

2012
Achim D. Brucker Burkhart Wolff

At its origins, OCL was conceived as a strict semantics for undefinedness, with the exception of the logical connectives of type Boolean that constitute a three-valued propositional logic. Recent versions of the OCL standard added a second exception element, which, similar to the null references in programming languages, is given a non-strict semantics. In this paper, we report on our results i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید