Displaying similar documents to “What is mathematical proof?”

Parametrized prime implicant-implicate computations for regular logics.

Anavai Ramesh, Neil V. Murray (1997)

Mathware and Soft Computing

Similarity:

Prime implicant-implicate generating algorithms for multiple-valued logics (MVL's) are introduced. Techniques from classical logic not requiring large normal forms or truth tables are adapted to certain regular'' multiple-valued logics. This is accomplished by means of signed formulas, a meta-logic for multiple valued logics; the formulas are normalized in a way analogous to negation normal form. The logic of signed formulas is classical in nature. The presented method is based on path...

An algebraic completeness proof for Kleene's 3-valued logic

Maurizio Negri (2002)

Bollettino dell'Unione Matematica Italiana

Similarity:

We introduce Kleene's 3-valued logic in a language containing, besides the Boolean connectives, a constant n for the undefined truth value, so in developing semantics we can switch from the usual treatment based on DM-algebras to the narrower class of DMF-algebras (De Morgan algebras with a single fixed point for negation). A sequent calculus for Kleene's logic is introduced and proved complete with respect to threevalent semantics. The completeness proof is based on a version of the...

Logic of existence and logic of knowledge. Epistemic and non epistemic aspects of logic

Michel Bourdeau (2003)

Philosophia Scientiae

Similarity:

Contrairement à ce qui a parfois été dit, la logique classique et la logique intuitionniste ne s’opposent pas comme une logique de l’existence à une logique de la connaissance. Les considérations épistémologiques trouvent naturellement leur place dans le cadre de la logique classique, sans qu’il soit nécessaire de faire intervenir aucun principe intuitionniste ; il suffit pour cela de reconnaître que la logique ne peut se passer de la notion d’assertion, ou si l’on préfère de jugement....

Dialectics and Logic

Svetlana Knjazev Adamović (2012)

Review of the National Center for Digitization

Similarity:

On the Properties of the Möbius Function

Magdalena Jastrzebska, Adam Grabowski (2006)

Formalized Mathematics

Similarity:

We formalized some basic properties of the Möbius function which is defined classically as [...] as e.g., its multiplicativity. To enable smooth reasoning about the sum of this number-theoretic function, we introduced an underlying many-sorted set indexed by the set of natural numbers. Its elements are just values of the Möbius function.The second part of the paper is devoted to the notion of the radical of number, i.e. the product of its all prime factors.The formalization (which is...