Universal Truth Calculator

In modern formal logic, the distinction between first-order logic and second-order logic centers on what the logical system is allowed to mathematically quantify, as well as the fundamental limits of what each system can prove. First-Order Logic (Predicate Logic) First-order logic "drills down" into the structure of a statement by allowing you to quantify over individual objects . In this system, you use lowercase letters for specific objects (like s for Socrates) and uppercase letters for properties (like M for Mortal), creating functional statements such as M(s) to mean "Socrates is mortal" . You can apply universal (∀) or existential (∃) quantifiers to these individual objects to express ideas like "Each object x is red" . A defining feature of first-order logic is that it is logically "Complete," a mathematical trait proven by Kurt Gödel . This completeness means that every universal truth within this system can theoretically be proven using formal rules of inference . However, Alonzo Church and Alan Turing proved that it lacks a "decision procedure"—meaning it is impossible to build a computer program capable of automatically deciding the validity of every possible first-order formula . Second-Order Logic (Higher-Order Logic) Second-order logic expands the expressive power of the system by allowing you to quantify over properties and relations themselves, rather than just individual objects . Instead of simply assigning a property to an object, second-order logic can express massive comparative statements, such as "Every property F that Socrates has, Plato also has" . The Key Distinction and Limitation While moving to second-order logic gives mathematicians and logicians a much more powerful language, it sacrifices structural stability. The most critical difference is that, unlike first-order logic, second-order logic is fundamentally incomplete . Because of its immense scope, there are "Universal Truths" in second-order systems that can never be definitively proven through rules of inference . This establishes a major boundary in the architecture of reason: as logic becomes expressive enough to evaluate complex properties, it loses the ability to mathematically guarantee all of its own truths.