English
Related papers

Related papers: Aletheia, double negation and negation

200 papers

The science of complexity is based on a new way of thinking that stands in sharp contrast to the philosophy underlying Newtonian science, which is based on reductionism, determinism, and objective knowledge. This paper reviews the…

Computational Complexity · Computer Science 2008-07-29 Francis Heylighen , Paul Cilliers , Carlos Gershenson

This note analyzes in terms of categorial proof theory some standard assumptions about negation in the absence of any other connective. It is shown that the assumptions for an involutive negation, like classical negation, make a kind of…

Logic · Mathematics 2007-05-23 K. Dosen , Z. Petric

Partial correctness of imperative or functional programming divides in logic programming into two notions. Correctness means that all answers of the program are compatible with the specification. Completeness means that the program produces…

Logic in Computer Science · Computer Science 2025-08-26 Włodzimierz Drabent

When teaching an elementary logic course to students who have a general scientific background but have never been exposed to logic, we have to face the problem that the notions of deduction rule and of derivation are completely new to them,…

Logic in Computer Science · Computer Science 2016-01-08 Gilles Dowek

Any system based on axioms is incomplete because the axioms cannot be proven from the system, just believed. But one system can be less-incomplete than other. Neutrosophy is less-incomplete than many other systems because it contains them.…

General Mathematics · Mathematics 2007-05-23 Carlos Gershenson

Classical (or Boolean) type theory is the type theory that allows the type inference $\sigma \to \bot) \to \bot => \sigma$ (the type counterpart of double-negation elimination), where $\sigma$ is any type and $\bot$ is absurdity type. This…

Logic in Computer Science · Computer Science 2016-06-22 Ken Akiba

Nonmonotonic reasoning is a pattern of reasoning that allows an agent to make and retract (tentative) conclusions from inconclusive evidence. This paper gives a possible-worlds interpretation of the nonmonotonic reasoning problem based on…

Artificial Intelligence · Computer Science 2013-04-10 Carl Kadie

We show the functional completeness for the connectives of the non-trivial negation inconsistent logic C by using a well-established method implementing purely proof-theoretic notions only. Firstly, given that C contains a strong negation,…

Logic in Computer Science · Computer Science 2025-07-10 Sara Ayhan , Hrafn Valtýr Oddsson

This report first shows the equivalence bewteen several formulations of classical logic in intuitionistic logic (tertium non datur, reductio ad absurdum, Pierce's law). Then it establishes the correctness of the G\"odel-Kolmogorov…

Logic · Mathematics 2016-02-26 Richard Moot , Christian Retoré

We consider a philosophical question that is implicit in Selmer Bringsjord's paper, "The narrational case against Church's Thesis": If, as Mendelson argues, the classically accepted definitions of foundational concepts such as "partial…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

The full power of human language-based communication cannot be realized without negation. All human languages have some form of negation. Despite this, negation remains a challenging phenomenon for current natural language understanding…

Computation and Language · Computer Science 2022-11-02 Abhilasha Ravichander , Matt Gardner , Ana Marasović

One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…

Logic · Mathematics 2025-10-14 Oscar Ramírez

A true lie is a lie that becomes true when announced. In a logic of announcements, where the announcing agent is not modelled, a true lie is a formula (that is false and) that becomes true when announced. We investigate true lies and other…

Artificial Intelligence · Computer Science 2018-02-06 Thomas Ågotnes , Hans van Ditmarsch , Yanjing Wang

It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…

Logic in Computer Science · Computer Science 2017-01-11 Jean Gallier

We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…

Logic · Mathematics 2010-11-24 Shira Kritchman , Ran Raz

We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms,…

Artificial Intelligence · Computer Science 2011-06-02 R. Rosati

A formal theory of meaning (the process of knowledge accumulation) as multiplicative chaos is proposed. The epistemological process is understood as the process of subjective extraction of some knowledge from the incoming information. The…

General Physics · Physics 2021-08-23 Gary Gindler

In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…

Discrete Mathematics · Computer Science 2009-10-20 Laurent Lyaudet , Frédéric Mazoit , Stephan Thomasse

The paper presents a fresh new comprehensive ideology on Neutrosophic Logic based on contradiction study. It does a survey on Chinese philosophy. The paper aims to solve the chaos of logic and exhibit the potential power of neutrosophy: a…

General Mathematics · Mathematics 2007-05-23 Feng Liu , Florentin Smarandache

The concept of a judgment as a logical action which introduces new information into a deductive system is examined. This leads to a way of mathematically representing implication which is distinct from the familiar material implication,…

Probability · Mathematics 2011-11-10 Ruadhan O'Flanagan