Latest Research in Logic, programming, and type systems

Top Research Topics in Logic, programming, and type systems

• Logic in Computer Science — 10 papers
• Data Structures and Algorithms — 5 papers
• Logic, programming, and type systems — 4 papers
• Distributed, Parallel, and Cluster Computing — 3 papers
• Logic, Reasoning, and Knowledge — 2 papers
• Machine Learning — 2 papers
• Computational Complexity — 2 papers
• Category Theory — 2 papers
• Logic — 2 papers
• Databases — 2 papers

Highest-Cited Papers

1. ZTL — Zero-Trust Logic (5 citations)
2. Infinitary negative translations and Glivenko logic
3. COMPASS: Ordered Clustered Routing at 100K Scale
4. An Explicit Ordinal Bound for System T Dialogue Trees
5. Towards a Proof-Theoretic Analysis of Incorrect/Incomplete Proofs
6. Improved lower bounds for decomposable randomized encoding
7. On Models of the Planar Lambda Calculus
8. A Common Ancestor of PDL, Conjunctive Queries, and Unary Negation First-order Logic
9. Subsumption in $\mathcal{FL}_{\bot \mathit{reg}}$ with TBoxes Is in ExpTime
10. Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition
11. Formal Verification of Discrete Integration Properties from First Principles
12. Intuitionistic Implication in Elementary Team Logics
13. How Can We Shrink the Family of Test Databases? Query Containment with Nulls and Comparisons
14. The Reflexive Closure Theorem: Closure Without Collapse in Reflexive Systems Paper 56 of the NEMS Suite
15. Syntax Cannot Exhaust Semantics: A No-Reduction Theorem for Reflexive Systems Paper 53 of the NEMS Suite
16. Syntax Cannot Exhaust Semantics: A No-Reduction Theorem for Reflexive Systems Paper 53 of the NEMS Suite
17. Toward Optimal Time-Space Tradeoffs for Set Reconciliation
18. Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient
19. A Catalogue of Properties of Binary Relations: Entailments, Incompatibilities, and Independence Results
20. Width-Bounded Equational Derivations for Finite Graph Expressions