- See Also
-
Links
- “A Systematic Comparison of Syllogistic Reasoning in Humans and Language Models”, Eisape et al 2023
- “Getting from Generative AI to Trustworthy AI: What LLMs Might Learn from Cyc”, Lenat & Marcus 2023
- “Evaluating Superhuman Models With Consistency Checks”, Fluri et al 2023
- “LLM+P: Empowering Large Language Models With Optimal Planning Proficiency”, Liu et al 2023
- “Tighter Bounds on the Expressivity of Transformer Encoders”, Chiang et al 2023
- “Discovering Latent Knowledge in Language Models Without Supervision”, Burns et al 2022
- “Transformers Implement First-Order Logic With Majority Quantifiers”, Merrill & Sabharwal 2022
- “FOLIO: Natural Language Reasoning With First-Order Logic”, Han et al 2022
- “Language Models Show Human-like Content Effects on Reasoning”, Dasgupta et al 2022
- “Mathematical Proof Between Generations”, Bayer et al 2022
- “Maieutic Prompting: Logically Consistent Reasoning With Recursive Explanations”, Jung et al 2022
- “On the Paradox of Learning to Reason from Data”, Zhang et al 2022
- “Logical Intuition Is Not Really About Logic”, Ghasemi et al 2022
- “Logical Activation Functions: Logit-space Equivalents of Probabilistic Boolean Operators”, Lowe et al 2021
- “How the Slowest Computer Programs Illuminate Math’s Fundamental Limits: The Goal of the ‘busy Beaver’ Game Is to Find the Longest-running Computer Program. Its Pursuit Has Surprising Connections to Some of the Most Profound Questions and Concepts in Mathematics”, Pavlus 2020
- “On the Measure of Intelligence”, Chollet 2019
- “Best Practices: Formal Proofs, the Fine Print and Side Effects”, Murray & Oorschot 2018
- “A Logic for Statutes”, Lawsky 2017
- “One Man’s Modus Ponens”, Gwern 2012
- “Why Philosophers Should Care About Computational Complexity”, Aaronson 2011
- “An Editor Recalls Some Hopeless Papers”, Hodges 1998
- “‘Begging the Question’”, Sparkes 1966
- “A Plea for Excuses: The Presidential Address”, Austin 1956
- “Symposium: Facts and Propositions”, Ramsey & Moore 1927
- “Review of Tractatus Logico-Philosophicus by Ludwig Wittgenstein”, Ramsey 1923
- Sort By Magic
- Wikipedia
- Miscellaneous
- Link Bibliography
See Also
Links
“A Systematic Comparison of Syllogistic Reasoning in Humans and Language Models”, Eisape et al 2023
“A Systematic Comparison of Syllogistic Reasoning in Humans and Language Models”
“Getting from Generative AI to Trustworthy AI: What LLMs Might Learn from Cyc”, Lenat & Marcus 2023
“Getting from Generative AI to Trustworthy AI: What LLMs might learn from Cyc”
“Evaluating Superhuman Models With Consistency Checks”, Fluri et al 2023
“LLM+P: Empowering Large Language Models With Optimal Planning Proficiency”, Liu et al 2023
“LLM+P: Empowering Large Language Models with Optimal Planning Proficiency”
“Tighter Bounds on the Expressivity of Transformer Encoders”, Chiang et al 2023
“Tighter Bounds on the Expressivity of Transformer Encoders”
“Discovering Latent Knowledge in Language Models Without Supervision”, Burns et al 2022
“Discovering Latent Knowledge in Language Models Without Supervision”
“Transformers Implement First-Order Logic With Majority Quantifiers”, Merrill & Sabharwal 2022
“Transformers Implement First-Order Logic with Majority Quantifiers”
“FOLIO: Natural Language Reasoning With First-Order Logic”, Han et al 2022
“Language Models Show Human-like Content Effects on Reasoning”, Dasgupta et al 2022
“Language models show human-like content effects on reasoning”
“Mathematical Proof Between Generations”, Bayer et al 2022
“Maieutic Prompting: Logically Consistent Reasoning With Recursive Explanations”, Jung et al 2022
“Maieutic Prompting: Logically Consistent Reasoning with Recursive Explanations”
“On the Paradox of Learning to Reason from Data”, Zhang et al 2022
“Logical Intuition Is Not Really About Logic”, Ghasemi et al 2022
“Logical Activation Functions: Logit-space Equivalents of Probabilistic Boolean Operators”, Lowe et al 2021
“Logical Activation Functions: Logit-space equivalents of Probabilistic Boolean Operators”
“How the Slowest Computer Programs Illuminate Math’s Fundamental Limits: The Goal of the ‘busy Beaver’ Game Is to Find the Longest-running Computer Program. Its Pursuit Has Surprising Connections to Some of the Most Profound Questions and Concepts in Mathematics”, Pavlus 2020
“On the Measure of Intelligence”, Chollet 2019
“Best Practices: Formal Proofs, the Fine Print and Side Effects”, Murray & Oorschot 2018
“Best Practices: Formal Proofs, the Fine Print and Side Effects”
“A Logic for Statutes”, Lawsky 2017
“One Man’s Modus Ponens”, Gwern 2012
“Why Philosophers Should Care About Computational Complexity”, Aaronson 2011
“Why Philosophers Should Care About Computational Complexity”
“An Editor Recalls Some Hopeless Papers”, Hodges 1998
“‘Begging the Question’”, Sparkes 1966
“A Plea for Excuses: The Presidential Address”, Austin 1956
“Symposium: Facts and Propositions”, Ramsey & Moore 1927
“Review of Tractatus Logico-Philosophicus by Ludwig Wittgenstein”, Ramsey 1923
“Review of Tractatus Logico-Philosophicus by Ludwig Wittgenstein”
Sort By Magic
Annotations sorted by machine learning into inferred 'tags'. This provides an alternative way to browse: instead of by date order, one can browse in topic order. The 'sorted' list has been automatically clustered into multiple sections & auto-labeled for easier browsing.
Beginning with the newest annotation, it uses the embedding of each annotation to attempt to create a list of nearest-neighbor annotations, creating a progression of topics. For more details, see the link.
mathlogic
logic-models
reasoning
Wikipedia
Miscellaneous
Link Bibliography
-
https://arxiv.org/abs/2308.04445: “Getting from Generative AI to Trustworthy AI: What LLMs Might Learn from Cyc”, Doug Lenat, Gary Marcus -
https://arxiv.org/abs/2209.00840: “FOLIO: Natural Language Reasoning With First-Order Logic”, -
2022-ghasemi.pdf: “Logical Intuition Is Not Really About Logic”, Omid Ghasemi, Simon Handley, Stephanie Howarth, Ian R. Newman, Valerie A. Thompson -
https://www.quantamagazine.org/the-busy-beaver-game-illuminates-the-fundamental-limits-of-math-20201210/: “How the Slowest Computer Programs Illuminate Math’s Fundamental Limits: The Goal of the ‘busy Beaver’ Game Is to Find the Longest-running Computer Program. Its Pursuit Has Surprising Connections to Some of the Most Profound Questions and Concepts in Mathematics”, John Pavlus -
modus: “One Man’s Modus Ponens”, Gwern