-
Notifications
You must be signed in to change notification settings - Fork 0
Logic
Аббас Гусенов edited this page Nov 5, 2025
·
2 revisions
- Хабр / Релиз открытого инструментария для изучения логики LogiCola 3.0
- 24 most common logical fallacies by Bruno Pešec
- BBC Bitesize / What is logical reasoning?
- Перед лицом Сингулярности
- Open Textbook Library / Logical Reasoning by Bradley H. Dowden
- Exclusive or
- Template:Mathematical logic
- Computation tree logic (CTL) is used in formal verification of software or hardware artifacts, typically by software applications known as model checkers, which determine if a given artifact possesses safety or liveness properties.
- Template:Non-classical logic
- Temporal logic has found an important application in formal verification, where it is used to state requirements of hardware or software systems.
- Linear temporal logic is a modal temporal logic with modalities referring to time.
- Kripke semantics is a formal semantics for non-classical logic systems
- First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables, so that rather than propositions such as "Socrates is a man", one can have expressions in the form "there exists x such that x is Socrates and x is a man", where "there exists" is a quantifier, while x is a variable.
- Superposition calculus is a calculus for reasoning in equational first-order logic.
-
Hoare logic is a formal system with a set of logical rules for reasoning rigorously about the correctness of computer programs.
- Hoare triple describes how the execution of a piece of code changes the state of the computation
- Категория:Логические ошибки
- Logic in computer science
- Logic gate an idealized or physical device implementing a Boolean function, a logical operation performed on one or more binary inputs that produces a single binary output.
- Logic programming is a programming paradigm which is largely based on formal logic.
- Reasoning system is a software system that generates conclusions from available knowledge using logical techniques such as deduction and induction.
- Category:Automated reasoning
- Category:Normal forms (logic)
-
Conjunctive normal form
- In Boolean logic, a formula is in conjunctive normal form (CNF) or clausal normal form if it is a conjunction of one or more clauses, where a clause is a disjunction of literals; otherwise put, it is a product of sums or an AND of ORs. As a canonical normal form, it is useful in automated theorem proving and circuit theory.
-
Disjunctive normal form
- In boolean logic, a disjunctive normal form (DNF) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs, a sum of products, or (in philosophical logic) a cluster concept. As a normal form, it is useful in automated theorem proving.
-
Binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function. On a more abstract level, BDDs can be considered as a compressed representation of sets or relations. Unlike other compressed representations, operations are performed directly on the compressed representation, i.e. without decompression.
- Similar data structures include negation normal form (NNF), Zhegalkin polynomials, and propositional directed acyclic graphs (PDAG).
- In popular usage, the term BDD almost always refers to Reduced Ordered Binary Decision Diagram (ROBDD in the literature, used when the ordering and reduction aspects need to be emphasized). The advantage of an ROBDD is that it is canonical (unique) for a particular function and variable order. This property makes it useful in functional equivalence checking and other operations like functional technology mapping.
- Metalogic is the study of the metatheory of logic.
- Template:Metalogic
- Необходимое и достаточное условия
- Закон достаточного основания
- Logic simulation is the use of simulation software to predict the behavior of digital circuits and hardware description languages.
- Automated theorem proving is a subfield of automated reasoning and mathematical logic dealing with proving mathematical theorems by computer programs.
- Список когнитивных искажений
- Logical reasoning is a mental activity that aims to arrive at a conclusion in a rigorous way.
- Мел
- Wikipedia
- TED Talk / The paradox at the heart of mathematics: Gödel's Incompleteness Theorem by Marcus du Sautoy
- Quanta Magazine / How Gödel’s Proof Works
- r/explainlikeimfive
- Mathematics Stack Exchange
- AlgorithmSoup.wordpress.com / What Made Gödel’s Incompleteness Theorem Hard to Prove: It’s about How You Say it, Not Just What You Say
- 200 ЗАКОНОВ МИРОЗДАНИЯ / Теорема Гёделя о неполноте
- neerc.ifmo.ru/wiki / 1я и 2я теоремы Геделя о неполноте арифметики
- теорема геделя на коленке (Анатолий Воробей, программист в Google)
- YouTube / Теорема Гёделя о (не)полноте (Маткульт-привет! :: Алексей Савватеев и Ко)
- Хабр
- Stanford Encyclopedia of Philosophy / Gödel’s Incompleteness Theorems
- iXBT.com / Grok-3 Mini вошёл в историю, опередив все остальные модели. Илон Маск заявил, что «скоро ИИ намного превзойдет лучших людей в рассуждениях» 15 апреля 2025
- Модель Grok-3 Mini, разработанная компанией xAI, успешно прошла один из самых сложных тестов на логическое рассуждение.
- Grok-3 Mini набрал 120 из 120 баллов в задании Marcus Problem, где нужно было правильно интерпретировать запутанные и перемешанные предложения.
- В тесте Alice+ Problem модель получила 24 из 24 баллов, несмотря на наличие отвлекающих данных, которые обычно сбивают с толку другие ИИ.