Revision #5595 → #5596 · back to history
modifiedProposition (truth-bearer)f122b2d35d38
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"which can be true or false"},"resolution":"not_attempted"}}] |
modifiedCompound proposition via connectives7d9a4b765a6c
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"Compound propositions are formed by connecting propositions by logical connectives"},"resolution":"not_attempted"}}] |
modifiedClassical truth-functional propositional logic14a114d4e6a8
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"having precisely one of two possible truth values"},"resolution":"not_attempted"}}] |
modifiedStatement (declarative sentence)edd6d092ba45
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Declarative sentences","snippet":"which are defined as declarative sentences having truth value"},"resolution":"not_attempted"}}] |
modifiedExample statements9f8a2b01e033
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Declarative sentences","snippet":"Examples of statements might include"},"resolution":"not_attempted"}}] |
modifiedCompound sentencec868b8d74fb9
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Compounding sentences with connectives","snippet":"Compound sentences are formed from simpler sentences and express relationships among the constituent sentences"},"resolution":"not_attempted"}}] |
modifiedExample compound sentences134d8cda66db
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Compounding sentences with connectives","snippet":"Examples of such compound sentences might include"},"resolution":"not_attempted"}}] |
modifiedSimple/atomic sentence6361c8add989
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Compounding sentences with connectives","snippet":"they are called simple sentences"},"resolution":"not_attempted"}}] |
modifiedSentential connective3bcc503ea4c4
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Compounding sentences with connectives","snippet":"Sentential connectives are a broader category that includes logical connectives"},"resolution":"not_attempted"}}] |
modifiedLogical connectivefba847b5f1bd
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Compounding sentences with connectives","snippet":"is a kind of sentential connective with the characteristic feature"},"resolution":"not_attempted"}}] |
modifiedArgument (premises and conclusion)a61d6e88d74e
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"a61d6e88d74e:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Arguments","snippet":"An argument is defined as a pair of things, namely a set of sentences"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.Theory.ModelsBoundedFormula","module":"Mathlib.ModelTheory.Satisfiability"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedExample argument (modus ponens)b1e55776a96d
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Example argument","snippet":"The following is an example of an argument within the scope of propositional logic"},"resolution":"not_attempted"}}] |
modifiedValid argument884b6c61c7d6
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"884b6c61c7d6:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Validity and soundness","snippet":"it is necessary that, if all its premises are true, its conclusion is true"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.Theory.ModelsBoundedFormula","module":"Mathlib.ModelTheory.Satisfiability"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedSound argumentaa336809101f
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Validity and soundness","snippet":"An argument is sound if, and only if, it is valid and all its premises are true"},"resolution":"not_attempted"}}] |
modifiedPropositional variable3e4747faf750
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Propositional variables","snippet":"which are interpreted as variables representing statements"},"resolution":"not_attempted"}}] |
modifiedSyntactic consequence (inference line)82ae18b86d56
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Gentzen notation","snippet":"The inference line represents syntactic consequence"},"resolution":"not_attempted"}}] |
modifiedAtomic formula (primitive symbols)80ea2fb5860e
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"80ea2fb5860e:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Language","snippet":"a set of primitive symbols, called atomic formulas"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula.IsAtomic","module":"Mathlib.ModelTheory.Complexity"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedConnective (operator symbols)c716013d330e
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"c716013d330e:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Language","snippet":"a set of operator symbols, called connectives"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula.imp","module":"Mathlib.ModelTheory.Syntax"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedWell-formed formuladaa4f9b0fd95
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"daa4f9b0fd95:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Language","snippet":"A well-formed formula is any atomic formula, or any formula that can be built up from atomic formulas"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula.IsQF","module":"Mathlib.ModelTheory.Complexity"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedDefinition 1: atomic formulas are formulas9fba29fd515b
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"9fba29fd515b:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Syntax","snippet":"Atomic propositional variables are formulas"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula.IsAtomic","module":"Mathlib.ModelTheory.Complexity"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedDefinition 2: composition of formulas85ba08e0ca09
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"85ba08e0ca09:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Syntax","snippet":"possibly but not necessarily atomic, possibly but not necessarily distinct, formulas"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula.imp","module":"Mathlib.ModelTheory.Syntax"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedDefinition 3: closure clausedfb8d785cf7b
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"dfb8d785cf7b:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Syntax","snippet":"Nothing else is a formula"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula","module":"Mathlib.ModelTheory.Syntax"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedWell-formed formula examplesfcb329af441a
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Syntax","snippet":"we have the following as examples of well-formed formulas"},"resolution":"not_attempted"}}] |
modifiedContext-free (BNF) grammar for the language9bea6d218a01
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"CF grammar in BNF","snippet":"to write a context-free (CF) grammar for the language"},"resolution":"not_attempted"}}] |
modifiedPropositional constants, variables, schemataec02206cad57
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Constants and schemata","snippet":"Propositional constants represent some particular proposition"},"resolution":"not_attempted"}}] |
modifiedTruth/falsity constants55c551dfcc58
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"55c551dfcc58:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Constants and schemata","snippet":"which always evaluates to True"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula.realize_top","module":"Mathlib.ModelTheory.Semantics"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedBivalence, noncontradiction, excluded middle161f7bbb0ec2
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantics","snippet":"there are only two semantic values"},"resolution":"not_attempted"}}] |
modifiedInterpretation (case)f2ee2d794ae8
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"f2ee2d794ae8:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Interpretation (case) and argument","snippet":"is an assignment of semantic values to each formula"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.Structure","module":"Mathlib.ModelTheory.Basic"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedNumber of possible interpretationsfe9a823a4e24
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"fe9a823a4e24:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Interpretation (case) and argument","snippet":"distinct possible interpretations"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"Fintype.card_fun","module":"Mathlib.Data.Fintype.BigOperators"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedCounterexampled11790dd2b42
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Interpretation (case) and argument","snippet":"a counterexample is defined as a case"},"resolution":"not_attempted"}}] |
modifiedTruth-functionality of connectives6cbaee036d18
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"6cbaee036d18:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Propositional connective semantics","snippet":"the assumption of the truth-functionality of the connectives"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula.Realize","module":"Mathlib.ModelTheory.Semantics"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedTruth table determines connective semantics5d4039df53ba
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"5d4039df53ba:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantics via truth tables","snippet":"It is sufficient for determining the semantics of each of these operators"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula.Realize","module":"Mathlib.ModelTheory.Semantics"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedSemantics of the five connectives (assignment style)7968c7597a43
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"7968c7597a43:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantics via assignment expressions","snippet":"the five connectives are defined as"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula.realize_imp","module":"Mathlib.ModelTheory.Semantics"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedFunctional completeness with minimal connectivesb648d4292f5c
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Connective definition methods","snippet":"a truth-functionally complete system"},"resolution":"not_attempted"}}] |
modifiedEquivalence vs biconditionale2503d5ea2f3
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"e2503d5ea2f3:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Connective definition methods","snippet":"distinguish equivalence from the biconditional"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.Theory.Iff","module":"Mathlib.ModelTheory.Equivalence"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedTruth-in-a-case4e4473ae9854
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"4e4473ae9854:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic truth, validity, consequence","snippet":"is true under an interpretation"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula.Realize","module":"Mathlib.ModelTheory.Semantics"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedFalsity-in-a-case705a2424eb07
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"705a2424eb07:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic truth, validity, consequence","snippet":"is false under an interpretation"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.BoundedFormula.realize_not","module":"Mathlib.ModelTheory.Semantics"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedSemantic consequencec7445d5dc3d1
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"c7445d5dc3d1:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic truth, validity, consequence","snippet":"is a semantic consequence"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.Theory.ModelsBoundedFormula","module":"Mathlib.ModelTheory.Satisfiability"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedValid formula (tautology)d04524f38533
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"d04524f38533:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic truth, validity, consequence","snippet":"is logically valid"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.Theory.ModelsBoundedFormula","module":"Mathlib.ModelTheory.Satisfiability"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedConsistent sentencede2dd64d3508
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"de2dd64d3508:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic truth, validity, consequence","snippet":"is consistent if it is true under at least one interpretation"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.Theory.IsSatisfiable","module":"Mathlib.ModelTheory.Satisfiability"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedComplete case / consistent case523ff6285a41
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"523ff6285a41:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic truth, validity, consequence","snippet":"Complete case"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.Theory.IsComplete","module":"Mathlib.ModelTheory.Satisfiability"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedClassical logic metatheorems (bivalence consequences)e266f1080248
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"e266f1080248:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic truth, validity, consequence","snippet":"For any given interpretation, a given formula is either true or false under it"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.Theory.IsMaximal.mem_or_not_mem","module":"Mathlib.ModelTheory.Satisfiability"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedSemantic vs syntactic proof systems886c72382463
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Proof systems","snippet":"semantic proof systems rely on semantic consequence"},"resolution":"not_attempted"}}] |
modifiedTruth table (semantic proof method)d7c1bdb7688b
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Truth tables","snippet":"A truth table is a semantic proof method used to determine the truth value"},"resolution":"not_attempted"}}] |
modifiedSemantic tableau395dc057d06a
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic tableaux","snippet":"A semantic tableau is another semantic proof technique that systematically explores the truth of a proposition"},"resolution":"not_attempted"}}] |
modifiedHilbert-style axiomatic system860827815882
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Axiomatic systems","snippet":"is a set of axioms or assumptions from which other statements"},"resolution":"not_attempted"}}] |
modifiedNatural deduction (proof method)8e1e863f5517
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Natural deduction","snippet":"Natural deduction is a syntactic method of proof that emphasizes the derivation of conclusions from premises"},"resolution":"not_attempted"}}] |
modifiedSequent calculus77adba69b2a8
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"77adba69b2a8:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Sequent calculus","snippet":"represents logical deductions as sequences or"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"Mathlib.Tactic.ITauto.IProp","module":"Mathlib.Tactic.ITauto"}}]}}] |
| match_kind | — | invocation |
| unlinked | — | [] |
modifiedValidity criterion via truth table6bb28931132e
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic proof via truth tables","snippet":"all the lines of a truth table come out true"},"resolution":"not_attempted"}}] |
modifiedTruth table invalidity example20b07a7e4cd7
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic proof via truth tables","snippet":"this table shows that"},"resolution":"not_attempted"}}] |
modifiedSemantic consequence via truth table4e88d3146307
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic proof via truth tables","snippet":"we can use a truth table to prove that a formula is a semantic consequence"},"resolution":"not_attempted"}}] |
modifiedAnalytic tableaux6159f5651392
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic proof via tableaux","snippet":"a more efficient, but nevertheless mechanical"},"resolution":"not_attempted"}}] |
modifiedSigned formula51b08e930fc6
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic proof via tableaux","snippet":"where a signed formula is an expression"},"resolution":"not_attempted"}}] |
modifiedClosure of a tableau branch/tree71d37e6f3ca2
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic proof via tableaux","snippet":"the branch is said to close"},"resolution":"not_attempted"}}] |
modifiedClosed tableau proves contradiction/tautology929645265c8b
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic proof via tableaux","snippet":"a closed tree is a proof that the original formula"},"resolution":"not_attempted"}}] |
modifiedTableau proof of argument validitya728aedf25c3
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Semantic proof via tableaux","snippet":"one first writes out the set of premise formulas"},"resolution":"not_attempted"}}] |
modifiedClassically valid argument formsc81f642d7423
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"List of classically valid argument forms","snippet":"these tautologies and semantic consequences hold"},"resolution":"not_attempted"}}] |
modifiedNatural deduction: rules of proof, no axioms6577c56f6628
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Syntactic proof via natural deduction","snippet":"no axioms are used other than these rules"},"resolution":"not_attempted"}}] |
modifiedProof (Suppes–Lemmon notation)201a051340b7
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Notation styles","snippet":"is a sequence of lines containing sentences"},"resolution":"not_attempted"}}] |
modifiedTen primitive rules of proof6391d50a2aa1
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Inference rules","snippet":"There are ten primitive rules of proof"},"resolution":"not_attempted"}}] |
modifiedNatural deduction proof example (MTT derivation)19c7a5226016
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Natural deduction proof example","snippet":"which shows that MTT is not a primitive rule"},"resolution":"not_attempted"}}] |
modifiedAxiomatic proof (tautologies + modus ponens)2db4b7a1b1e8
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Syntactic proof via axioms","snippet":"certain tautologies are taken as self-evident"},"resolution":"not_attempted"}}] |
modifiedFrege's six axioms (Begriffsschrift)8b9ffaef0749
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Frege's Begriffsschrift","snippet":"Frege's system used only implication and negation as connectives"},"resolution":"not_attempted"}}] |
modifiedŁukasiewicz's reduction of Frege's axioms73fe7e17f48e
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Łukasiewicz's P 2","snippet":"the third axiom is superfluous since it can be derived from the preceding two axioms"},"resolution":"not_attempted"}}] |
modifiedŁukasiewicz's P2 axiom system057ad0ff5ca3
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Łukasiewicz's P 2","snippet":"ukasiewicz is credited"},"resolution":"not_attempted"}}] |
modifiedSchematic form of P2 axiomsae0da929721c
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Schematic form of P 2","snippet":"using them to generate an infinite set of axioms"},"resolution":"not_attempted"}}] |
modifiedProof example in P2547fd53965a9
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Proof example in P 2","snippet":"As an example, a proof of"},"resolution":"not_attempted"}}] |
modifiedSoundness of classical propositional logic07feaf7aad76
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Metalogic","snippet":"it is sound"},"resolution":"not_attempted"}}] |
modifiedCompleteness of classical propositional logic9fd1a9f9bfeb
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Metalogic","snippet":"It is also complete"},"resolution":"not_attempted"}}] |
modifiedCompactness theorema26307c61481
| Field | From #5595 | To #5596 |
|---|
| links | — | [{"id":"a26307c61481:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Metalogic","snippet":"A further central result is compactness"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"FirstOrder.Language.Theory.isSatisfiable_iff_isFinitelySatisfiable","module":"Mathlib.ModelTheory.Satisfiability"}}]}}] |
| match_kind | — | generalization |
| unlinked | — | [] |
modifiedSyntactic consistency coincides with satisfiabilityf985e57a803e
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Metalogic","snippet":"syntactic consistency coincides with satisfiability"},"resolution":"not_attempted"}}] |
modifiedDecidability of classical propositional logic5d7878b04d91
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Metalogic","snippet":"Classical propositional logic is also decidable"},"resolution":"not_attempted"}}] |
modifiedNP-completeness of propositional satisfiability44d5e622d07a
| Field | From #5595 | To #5596 |
|---|
| links | — | [] |
| unlinked | — | [{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Propositional_calculus&oldid=1362265935","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"Solvers","snippet":"Deciding satisfiability of propositional logic formulas is an NP-complete problem"},"resolution":"not_attempted"}}] |