Search Results - "Recursion theory"

On a question of Slaman and Steel.

Authors: Day, Adam R. Marks, Andrew S.

Source: Transactions of the American Mathematical Society, Series B. 6/24/2026, Vol. 13, p379-402. 24p.

Translational Tiling with 8 Polyominoes is Undecidable.

Authors: Yang, Chao Zhang, Zhujun

Source: Discrete & Computational Geometry; Jun2026, Vol. 75 Issue 4, p1048-1059, 12p

The weakness of the Erdős–Moser theorem under arithmetic reductions.

Authors: Levy Patey, Ludovic Mimouni, Ahmed

Source: Journal of Mathematical Logic. Aug2026, Vol. 26 Issue 2, p1-36. 36p.

ONE IS ALL YOU NEED: ASSOCIATIVE SECOND-ORDER UNIFICATION WITHOUT FIRST-ORDER VARIABLES.

Authors: CERNA, DAVID M. PARSERT, JULIAN

Source: Logical Methods in Computer Science (LMCS); 2026, Vol. 22 Issue 2, p1-23, 23p

On the negativity of separable algorithmic representations of fields with additive inversions.

Authors: N., Karimova¹ nodirakarimova@bk.ru

Source: Uzbek Mathematical Journal. 2026, Vol. 70 Issue 2, p115-120. 6p.

Additive systems for Z are undecidable.

Authors: Zabolotskii, Andrei¹ andrei.zabolotskii@open.ac.uk

Source: Journal of Combinatorial Mathematics & Combinatorial Computing. Sep2026, Vol. 130, p241-253. 13p.

COMPUTABLE APPROXIMATIONS OF SEMICOMPUTABLE GRAPHS.

Authors: ČAČIĆ, VEDRAN ČELAR, MATEA HORVAT, MARKO et al.

Source: Logical Methods in Computer Science (LMCS); 2026, Vol. 22 Issue 1, p28:1-28:22, 22p

REPRESENTING GUARDEDNESS IN CALL-BY-VALUE AND GUARDED PARAMETERIZED MONADS.

Authors: GONCHAROV, SERGEY¹, s.goncharov@bham.ac.uk

Source: Logical Methods in Computer Science (LMCS); 2026, Vol. 22 Issue 1, p9:1-9:36, 36p

An algorithm for counting domino tilings of a rectangular chessboard.

Authors: Magomedov, Abdulkarim M. Lawrence, Serge A.

Source: Journal of Algebra Combinatorics Discrete Structures & Applications. 2026, Vol. 13 Issue 1, p15-27. 13p.

Type-Theory of Algorithms with Chain-Free Memory and Iterative Computations.

Authors: Loukanova, Roussanka¹ rloukanova@gmail.com

Source: Journal of Applied Logics- IfCoLog Journal of Logics & their Applications (FLAP). Jan2026, Vol. 13 Issue 1, p155-173. 19p.

Herbrand schemes for first-order logic.

Authors: Afshari, Bahareh Enqvist, Sebastian Leigh, Graham E.

Source: Archive for Mathematical Logic; Nov2025, Vol. 64 Issue 7/8, p1007-1076, 70p

WHAT MONADS CAN AND CANNOT DO WITH A FEW EXTRA PAGES.

Authors: MØGELBERG, RASMUS EJLERS ZWART, MAAIKE

Source: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 4, p5:1-5:38, 38p

Countable and finitary reductions on equivalence relations.

Authors: Meng-Che "Turbo" Ho Jackson, Stephen C. Lempp, Steffen et al.

Source: Fundamenta Mathematicae. 2025, Vol. 270 Issue 3, p201-221. 21p.

Relations enumerable from positive information.

Authors: Csima, Barbara F MacLean, Luke Rossegger, Dino

Source: Journal of Logic & Computation. Jul2025, Vol. 35 Issue 5, p1-16. 16p.

Subjects: Recursion theory, Mathematical formulas, Relation algebras

On Rosser theories.

Authors: Cheng, Yong¹ (AUTHOR)

Source: Journal of Logic & Computation. Jul2025, Vol. 35 Issue 5, p1-28. 28p.

Subjects: Mathematical logic, Recursion theory, Generalization, Theorists

On some computational properties of open sets.

Authors: Normann, Dag Sanders, Sam

Source: Journal of Logic & Computation. Jun2025, Vol. 35 Issue 4, p1-38. 38p.

Subjects: Functions of bounded variation, Recursion theory, Lambda calculus, Lebesgue measure, Computational mathematics

TOTALITY FOR MIXED INDUCTIVE AND COINDUCTIVE TYPES.

Authors: HYVERNAT, PIERRE¹, pierre.hyvernat@univ-smb.fr

Source: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 3, p1-24, 24p

On Programmatic Aspects of the Universality, Parameter, and Recursion Theorems of Classical Computability.

Authors: Kulyukin, Vladimir A.¹ (AUTHOR)

Source: Mathematics (2227-7390). Jul2025, Vol. 13 Issue 13, p2090. 24p.

On Strong and Weak Logics for Paraconsistent Computability.

Authors: Weber, Zach Cano-Jorge, Fernando

Source: Journal of Applied Logics- IfCoLog Journal of Logics & their Applications (FLAP). Jun2025, Vol. 12 Issue 5, p1349-1381. 33p.

Benign approximations and non-speedability.

Authors: Hölzl, Rupert Janicki, Philip

Source: Journal of Mathematical Logic. Jun2026, p1. 36p.