: Matemáticas: formal proof

mathematical logic > formal proof

formal proof

In logic and mathematics, a formal proof or derivation is a finite sequence of sentences (called well-formed formulas in the case of a formal language), each of which is an axiom, an assumption, or follows from the preceding sentences in the sequence by a rule of inference. It differs from a natural language argument in that it is rigorous, unambiguous and mechanically verifiable. If the set of assumptions is empty, then the last sentence in a formal proof is called a theorem of the formal system. The notion of theorem is not in general effective, therefore there may be no method by which we can always find a proof of a given sentence or determine that none exists. The concepts of Fitch-style proof, sequent calculus and natural deduction are generalizations of the concept of proof.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Formal_proof)

http://data.loterre.fr/ark:/67375/PSR-H3RTG9KW-M

RDF/XML TURTLE JSON-LD

Loterre