Coq
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
A Proof in Coq that Core Logic is not Paraconsistent
[Submitted on 4 Jun 2026] Title:A Proof in Coq that Core Logic is not Paraconsistent View PDF HTML (experimental)Abstract:First, this paper proves that Tennant's two claims (i.e. that his own logical system is paraconsistent, and that it overlaps minimal logic) are both false. Second, this proof is certified with Coq.
ZX-Calculus:Trace-Indexed Dependent Types and Epistemic Semantics
Announce Type: new Abstract: We propose ZX-Calculus (Knowledge Evolution Calculus), a conservative extension of Martin-Lof Dependent Type Theory (MLTT) integrating trace-indexed types, presheaf non-monotone semantics, and constructive AGM belief revision. A Coq mechanisation accompanies the paper (34 complete proofs; zero admits for the two central results). FinTrace(s0,sn) is an inductive family of typed execution traces.
Extraction and Search in Rocq: Theorems, Definitions and Their dependencies
Announce Type: new Abstract: Rocq (Coq) are now widely used in various fields, including software verification and mathematical proofs. When proving a new theorem, users often need to search and apply proven theorems to assist the current proof process. However, the current search command is limited to the environment of imported modules and cannot search for theorems outside of this scope.
Topology as Logic: Structural Role Geometry Across Formal, Software, Biological, and Prebiotic Systems
Announce Type: new Abstract: We ask whether dependency topology correlates with functional load-bearing organization as recoverable geometry -- not as a metaphor, but as a measurable structural property detectable by multilayer network analysis. Across seven independent substrates, we show that hub persistence and rank divergence under the Functional Proximity Law recover operational organization that domain experts describe as logic: axiomatic load-bearing structure in formal mathematics,...
Modelling and Verifying Neuronal Archetypes in Rocq
Announce Type: replace Abstract: Formal verification has become increasingly important because of the kinds of guarantees that it can provide for software systems. Verification of models of biological and medical systems is a promising application of formal verification. Human neural networks have recently been emulated and studied as a biological system.
A Computational Toolkit for Engagement and Scalable Assessment in a Large Logic Course
Announce Type: new Abstract: Large required courses in theoretical computer science face two related challenges: helping students engage with abstract material and supporting reliable student assessment at scale. This paper describes LogicLab, a lightweight computational toolkit developed for CS 245, Logic and Computation, at the University of Waterloo.