Formalizing Computational Paths and Fundamental Groups in Lean

Συγγραφείς: Ramos, Arthur F., de Oliveira, Anjolina G., de Queiroz, Ruy J. G. B., de Veras, Tiago M. L.

Θεματικοί όροι: Logic in Computer Science, Formal Languages and Automata Theory, 03B35, 55Q05, 68T01, F.4.1; I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.19142

Evaluating Autoformalization Robustness via Semantically Similar Paraphrasing

Συγγραφείς: Moore, Hayden, Shah, Asfahan

Θεματικοί όροι: Computation and Language, Logic in Computer Science, 03B35, 03F03, F.4.1; I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.12784

Determination of the fifth Busy Beaver value

Συγγραφείς: The bbchallenge Collaboration, Blanchard, Justin, Briggs, Daniel, Deka, Konrad, Fenner, Nathan, Forster, Yannick, Georgiev, Georgi, House, Matthew L., Hunter, Rachel, Iijil, Kądziołka, Maja, Kropitz, Pavel, Ligocki, Shawn, mxdys, Naściszewski, Mateusz, savask, Stérin, Tristan, Xu, Chris, Yuen, Jason, Zimmermann, Théo

Θεματικοί όροι: Logic in Computer Science, Formal Languages and Automata Theory, Logic, 03D10, 03B35 (Primary) 68Q05, 68Q45 (Secondary), F.1.1; F.4.1; I.2.3; D.2.4; F.4.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2509.12337

Higher-Order Pattern Unification Modulo Similarity Relations

Συγγραφείς: Dundua, Besik, Kutsia, Temur

Θεματικοί όροι: Artificial Intelligence, Logic in Computer Science, Logic, 03B70 (Primary) 68T37, 68T27, 68Q42, 03B40, 68V15 (Secondary), F.4.1; I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2507.13208

An Incremental Framework for Topological Dialogue Semantics: Efficient Reasoning in Discrete Spaces

Συγγραφείς: Santacana, Andreu Ballus

Θεματικοί όροι: Logic in Computer Science, Artificial Intelligence, Algebraic Topology, Logic, 03B05, 55U10, 68T27, F.4.1; I.2.3; I.2.4

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2506.00615

Incomplete Descriptions and Qualified Definiteness

Συγγραφείς: Więckowski, Bartosz

Πηγή: EPTCS 415, 2024, pp. 109-120

Θεματικοί όροι: Computer Science - Logic in Computer Science, F.4.1, I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2501.00488

Action Logic is Undecidable

Συγγραφείς: Kuznetsov, Stepan

Θεματικοί όροι: Computer Science - Logic in Computer Science, Mathematics - Logic, F.4.1, I.2.3, F.4.1, I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1912.11273

Action Logic is Undecidable

Συγγραφείς: Stepan Kuznetsov

Πηγή: ACM Transactions on Computational Logic. 22:1-26

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, I.2.3, F.4.1, FOS: Mathematics, Mathematics - Logic, Logic (math.LO), 16. Peace & justice, F.4.1, I.2.3, Logic in Computer Science (cs.LO)

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/1912.11273
http://arxiv.org/abs/1912.11273
https://www.arxiv-vanity.com/papers/1912.11273/
https://dl.acm.org/doi/10.1145/3445810
http://ui.adsabs.harvard.edu/abs/2019arXiv191211273K/abstract
https://dblp.uni-trier.de/db/journals/corr/corr1912.html#abs-1912-11273

Using Coalgebras and the Giry Monad for Interpreting Game Logics --- A Tutorial

Συγγραφείς: Doberkat, Ernst-Erich

Θεματικοί όροι: Computer Science - Logic in Computer Science, 03B45, 18C15, 18C20, F.4.1, I.2.3, I.2.4, G.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1701.00280

A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving

Συγγραφείς: Wiedijk, Freek

Πηγή: Logical Methods in Computer Science, Volume 8, Issue 1 (March 28, 2012) lmcs:1046

Θεματικοί όροι: Computer Science - Logic in Computer Science, F.4.1, I.2.3, I.2.4

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1201.3601

Ground interpolation for the theory of equality

Συγγραφείς: Fuchs, Alexander, Goel, Amit, Grundy, Jim, Krstić, Sava, Tinelli, Cesare

Πηγή: Logical Methods in Computer Science, Volume 8, Issue 1 (February 16, 2012) lmcs:709

Θεματικοί όροι: Computer Science - Logic in Computer Science, D.2.4, F.3.1, F.4.1, I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1111.5652

On the mathematical synthesis of equational logics

Συγγραφείς: Fiore, Marcelo, Hur, Chung-Kil

Πηγή: Logical Methods in Computer Science, Volume 7, Issue 3 (September 8, 2011) lmcs:1071

Θεματικοί όροι: Computer Science - Logic in Computer Science, Mathematics - Category Theory, Mathematics - Logic, D.3.1, F.3.1, F.3.2, F.4.1, I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1107.3031

Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies

Συγγραφείς: Kaminski, Mark, Schneider, Sigurd, Smolka, Gert

Πηγή: Logical Methods in Computer Science, Volume 7, Issue 1 (March 21, 2011) lmcs:969

Θεματικοί όροι: Computer Science - Logic in Computer Science, F.4.1, I.2.3, I.2.4

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1012.0746

On Constructive Connectives and Systems

Συγγραφείς: Avron, Arnon, Lahav, Ori

Πηγή: Logical Methods in Computer Science, Volume 6, Issue 4 (December 25, 2010) lmcs:967

Θεματικοί όροι: Computer Science - Logic in Computer Science, F.4.1, I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1011.4384

Generic Modal Cut Elimination Applied to Conditional Logics

Συγγραφείς: Pattinson, Dirk, Schröder, Lutz

Πηγή: Logical Methods in Computer Science, Volume 7, Issue 1 (March 17, 2011) lmcs:968

Θεματικοί όροι: Computer Science - Logic in Computer Science, F.4.1, I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1011.3479

Learning in a Compiler for MINSAT Algorithms

Συγγραφείς: Remshagen, Anja, Truemper, Klaus

Πηγή: Theory and practice of Logic Programming, Vol 3(3), pp 271-286, 2003

Θεματικοί όροι: Computer Science - Logic in Computer Science, F.4.1, I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/cs/0312032

Generic Automatic Proof Tools

Συγγραφείς: Paulson, Lawrence C.

Πηγή: published in Robert Veroff (editor), Automated Reasoning and its Applications: Essays in Honor of Larry Wos (MIT Press, 1997), 23-47

Θεματικοί όροι: Computer Science - Logic in Computer Science, F.4.1, I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/cs/9711106

Designing a Theorem Prover

Συγγραφείς: Paulson, Lawrence C.

Πηγή: published in S. Abramsky, D. M. Gabbay, T. S. E. Maibaum (editors), Handbook of Logic in Computer Science, Vol II (Oxford, 1992), 415-475

Θεματικοί όροι: Computer Science - Logic in Computer Science, F.4.1, I.2.3, D.1.1

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/cs/9301110

Reasoning with Individuals for the Description Logic SHIQ

Συγγραφείς: Horrock, Ian, Sattler, Ulrike, Tobies, Stephan

Θεματικοί όροι: Computer Science - Logic in Computer Science, Computer Science - Artificial Intelligence, F.4.1, I.2.3, I.2.4

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/cs/0005017

Practical Reasoning for Expressive Description Logics

Συγγραφείς: Horrocks, Ian, Sattler, Ulrike, Tobies, Stephan

Θεματικοί όροι: Computer Science - Logic in Computer Science, Computer Science - Artificial Intelligence, F.4.1, I.2.3, I.2.4

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/cs/0005014