[2606.01898] Auto formalisation of Goedel's Second Incompleteness Theorem in Binary Recursive Arithmetic
Abstract page for arXiv paper 2606.01898: Auto formalisation of Goedel's Second Incompleteness Theorem in Binary Recursive Arithmetic
America Forever Bytes
Other
Abstract page for arXiv paper 2606.01898: Auto formalisation of Goedel's Second Incompleteness Theorem in Binary Recursive Arithmetic
Abstract page for arXiv paper 2606.00812: A New Ehrenfeucht-Fraïssé Game for Dependence Logic
Abstract page for arXiv paper 2606.02387: Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs
Abstract page for arXiv paper 2605.30762: Bringing closure to theory combination properties
Abstract page for arXiv paper 2605.30618: Reducing Arbitrary Metric Temporal Formulas into Logic Programs under Answer Set Semantics
Abstract page for arXiv paper 2605.31260: On first-order definable operations on relational structures
Abstract page for arXiv paper 2605.31269: Aspects of Coherence in Dependence Logic
What’s one to do with some nice little relays of questionable pinout, and prototyping board? How about a quietly clicky 4-bit counter using relay logic with t...
Abstract page for arXiv paper 2305.09908: Properties of independence in $\mathrm{NSOP}_3$ theories
Abstract page for arXiv paper 2511.06113: Notions of rank and independence in countably categorical theories