Tootfinder

Å reise med tog kan være en prŸvelse.
Bane Nor bŸr ta seg et brett med boller og begynne med ansvarliggjŸring.
Vy også. Standarden på vognsett fra 90 tallet er begredelig. Vedlikehold og renhold likeså.
Er det ikke vognsett med problemer, så er det sporveksler og lyssignaler.
Etter å ha stått stille sŸr for Drammen i tre kvarter, er det bevegelse igjen... men hvor lenge?
#NorskTut

What if we stayed up till midnight to watch the logos turn gay? 👉👈🥺

"During his time at IBM, he wrote some of the first artificial intelligence software—his "geometry theorem machine" was the first advanced AI program, and the third AI program ever. It is a logical AI system that can prove theorems in planar geometry about parallel lines, congruence, and equality and inequality of segments and angles. Like Logic Theorist, it uses heuristics."

This https://arxiv.org/abs/2009.14324 has been replaced.
link: https://scholar.google.com/scholar?q=a

Characterizing Jacobians via the KP equation and via flexes and degenerate trisecants to the Kummer variety: an algebro-geometric approach
This paper is withdrawn since we found a flaw in the proof of Theorem 4, asserting that the base locus of the complete linear system of an ample line bundle on a complex abelian variety is reduced. The error is in page 7, line $ -14$, where we claim that the divisor "mathcal E" on the variety $X$ is linearly equivalent to zero. This is untrue. For instance, it would imply that, for a non-torsion point $x$ on an abelian surface $A$, letting $E_x$, $E_{-x}$, and $E_0$ the exceptional curves in th…

#ToutTerrain haben einfach mal eine Schalthebellösung für #Pinion 😍
Kostet happig, aber das ist auch echt ein Vorteil.

TT Shift:R Trigger für Pinion

This https://arxiv.org/abs/2502.19311 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Faithful Logic Embeddings in HOL -- Deep and Shallow
Deep and shallow embeddings of non-classical logics in classical higher-order logic have been explored, implemented, and used in various reasoning tools in recent years. This paper presents a method for the simultaneous deployment of deep and shallow embeddings of various degrees in classical higher-order logic. This enables flexible, interactive and automated theorem proving and counterexample finding at meta and object level, as well as automated faithfulness proofs between these logic embedd…

Duitse onrust over nationale goudstaven in VS. ‘Het is ons geld, het moet worden teruggebracht’ - NRC
https://www.nrc.nl/nieuws/2025/…

Recursive Difference Categories and Topos-Theoretic Universality
Andreu Ballus Santacana
https://arxiv.org/abs/2505.22931 https://arx…

Recursive Difference Categories and Topos-Theoretic Universality
We introduce a radically minimal categorical foundation for logic, semantics, and computation, built from a single generative axiom of recursive difference. From the null mnema M0 and iterated labeled extensions by D, we form the free category M and its sheaf topos Sh(M). We prove: Modal completeness: Lawvere-Tierney topologies on Sh(M) classify all standard modal logics (K, T, S4, S5) purely via submonoids of the free monoid D*. Fixed-point expressivity: The internal mu-calculus over infin…

This https://arxiv.org/abs/2501.13114 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Continuous Algebra: Algebraic Semantics for Continuous Propositional Logic
We have introduced continuous algebra as the algebraic semantics for Continuous Propositional Logic (CPL). A Continuous algebra is an MV-algebra together with an unary operator $κ$, analogous to the unary connective $\dfrac{1}{2}$ in CPL. We establish structural results, including the subdirect representation theorem. We also introduce $\ell u^*$-groups, which are lattice ordered groups with strong unit $u$, denoted by $\ell u$-groups, with a partial operator $^*$ that mimics the behavior of $…

Term Ordering Diagrams
M\'arton Hajdu, Robin Coutelier, Laura Kov\'acs, Andrei Voronkov
https://arxiv.org/abs/2505.22181 https://

Term Ordering Diagrams
The superposition calculus for reasoning in first-order logic with equality relies on simplification orderings on terms. Modern saturation provers use the Knuth-Bendix order (KBO) and the lexicographic path order (LPO) for discovering redundant clauses and inferences. Implementing term orderings is however challenging. While KBO comparisons can be performed in linear time and LPO checks in quadratic time, using the best known algorithms for these orders is not enough. Indeed, our experiments sh…