Add to ORKGBy extending the notion of a Well Formed Formula to include syntactically formalized rules for rejecting semantically incorrect expressions we recognize and reject expressions that have the semantic error of Pathological self-reference(Olcott 2004). The foundation of this system requires the notion of a BaseFact that anchors the semantic notions of True and False. When-so-ever a formal proof from BaseFacts of language L to a closed WFF X or ~X of language L does not exist X is decided to be semantically incorrect
The conventional notion of a formal system is adapted to conform to the sound deductive inference mo...
We present a logic for the specification and analysis of deductive systems. This logic is an extensi...
We prove several decidability and undecidability results for the satisfiability/validity problem of ...
By extending the notion of a Well Formed Formula to include syntactically formalized rules for rejec...
When we understand that every potential halt decider must derive a formal mathematical proof from it...
For any natural (human) or formal (mathematical) language L we know that an expression X of language...
Abstract: This paper proves decidability of a range of weak relevant logics using decision procedure...
Declarative logic programs (LP) based on the well-founded semantics (WFS) are widely used for knowle...
This article identifies problems with regard to providing criteria that regulate the matching of log...
International audienceWe look at characterizing which formulas are expressible in rich decidable log...
In this article, a syntactical proof of decidability ofmonadic first-order logic (and of its complet...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
This paper compares several models of formalization. It articulates criteria of correct formalizatio...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
AbstractWe consider positive rules in which the conclusion may contain existentially quantified vari...
The conventional notion of a formal system is adapted to conform to the sound deductive inference mo...
We present a logic for the specification and analysis of deductive systems. This logic is an extensi...
We prove several decidability and undecidability results for the satisfiability/validity problem of ...
By extending the notion of a Well Formed Formula to include syntactically formalized rules for rejec...
When we understand that every potential halt decider must derive a formal mathematical proof from it...
For any natural (human) or formal (mathematical) language L we know that an expression X of language...
Abstract: This paper proves decidability of a range of weak relevant logics using decision procedure...
Declarative logic programs (LP) based on the well-founded semantics (WFS) are widely used for knowle...
This article identifies problems with regard to providing criteria that regulate the matching of log...
International audienceWe look at characterizing which formulas are expressible in rich decidable log...
In this article, a syntactical proof of decidability ofmonadic first-order logic (and of its complet...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
This paper compares several models of formalization. It articulates criteria of correct formalizatio...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
AbstractWe consider positive rules in which the conclusion may contain existentially quantified vari...
The conventional notion of a formal system is adapted to conform to the sound deductive inference mo...
We present a logic for the specification and analysis of deductive systems. This logic is an extensi...
We prove several decidability and undecidability results for the satisfiability/validity problem of ...