We gratefully acknowledge support from
the Simons Foundation and member institutions.

Logic in Computer Science

Authors and titles for recent submissions

[ total of 42 entries: 1-10 | 11-20 | 21-30 | 31-40 | 41-42 ]
[ showing 10 entries per page: fewer | more | all ]

Fri, 31 May 2024

[1]  arXiv:2405.20083 [pdf, other]
Title: Tachis: Higher-Order Separation Logic with Credits for Expected Costs
Subjects: Logic in Computer Science (cs.LO); Programming Languages (cs.PL)
[2]  arXiv:2405.20057 [pdf, ps, other]
Title: A General Automata Model for First-Order Temporal Logics (Extended Version)
Subjects: Logic in Computer Science (cs.LO)
[3]  arXiv:2405.19968 [pdf, ps, other]
Title: A Dynamic Logic for Information Evaluation in Intelligence
Authors: Benjamin Icard
Subjects: Logic in Computer Science (cs.LO)
[4]  arXiv:2405.20263 (cross-list from math.CO) [pdf, ps, other]
Title: An algebraic proof of the graph orientation problem dichotomy for forbidden tournaments
Comments: 17 pages
Subjects: Combinatorics (math.CO); Computational Complexity (cs.CC); Logic in Computer Science (cs.LO); Rings and Algebras (math.RA)
[5]  arXiv:2405.19787 (cross-list from cs.CL) [pdf, other]
Title: From Symbolic Tasks to Code Generation: Diversification Yields Better Task Performers
Subjects: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Logic in Computer Science (cs.LO); Programming Languages (cs.PL)
[6]  arXiv:2405.19354 (cross-list from math.GM) [pdf, ps, other]
Title: Rotations of Gödel algebras with modal operators
Subjects: General Mathematics (math.GM); Artificial Intelligence (cs.AI); Logic in Computer Science (cs.LO)

Thu, 30 May 2024 (showing first 4 of 10 entries)

[7]  arXiv:2405.19270 [pdf, other]
Title: Formalising the Local Compactness of the Adele Ring
Subjects: Logic in Computer Science (cs.LO); Number Theory (math.NT)
[8]  arXiv:2405.19157 [pdf, ps, other]
Title: Which are the True Defeasible Logics?
Authors: Michael J. Maher
Subjects: Logic in Computer Science (cs.LO)
[9]  arXiv:2405.19096 [pdf, other]
Title: The Precise Complexity of Reasoning in $\mathcal{ALC}$ with $ω$-Admissible Concrete Domains (Extended Version)
Comments: This is the extended version of a paper presented at DL 2024: 37th International Workshop on Description Logics
Subjects: Logic in Computer Science (cs.LO)
[10]  arXiv:2405.19095 [pdf, ps, other]
Title: Groupoidal Realizability for Intensional Type Theory
Authors: Sam Speight
Comments: 43 pages, accepted for publication in Mathematical Structures in Computer Science special issue Advances in Homotopy Type Theory
Subjects: Logic in Computer Science (cs.LO); Category Theory (math.CT); Logic (math.LO)
[ total of 42 entries: 1-10 | 11-20 | 21-30 | 31-40 | 41-42 ]
[ showing 10 entries per page: fewer | more | all ]

Disable MathJax (What is MathJax?)

Links to: arXiv, form interface, find, cs, new, 2405, contact, help  (Access key information)