Search Results - abstracts AND ((axiomatic OR automatic) OR automation) computability AND recursion theory*

Research on a General State Formalization Method from the Perspective of Logic.

Authors: Qiu, Siyuan Xu, Jianfeng

Source: Mathematics (2227-7390); Oct2025, Vol. 13 Issue 20, p3324, 36p

Subject Terms: MODEL theory, INFORMATION theory, SEMANTICS, MATHEMATICAL logic

Execution trace sets for real computation

Authors: Declan Thompson

Source: Theoretical Computer Science. 940:2-17

Subject Terms: general algorithms, Blum-Shub-Smale machine, real computation, 0102 computer and information sciences, 0101 mathematics, Computation over the reals, computable analysis, Abstract and axiomatic computability and recursion theory, 01 natural sciences, trace semantics

File Description: application/xml

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

Subject Terms: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES

REDUCIBILITY IN SOME CATEGORIES OF PARTIAL RECURSIVE OPERATORS: Reducibility in some categories of partial recursive operators

Authors: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Contributors: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Source: Mathematical Logic Quarterly. 38:349-359

Subject Terms: Categories of machines, automata, partial recursive operators, reducibility, 01 natural sciences, partial recursive operator, dominical categories, Recursion categories, recursion categories, completeness, dominical categorie, creativeness, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Theory of numerations, effectively presented structures, domains

File Description: application/xml; application/pdf; STAMPA

Access URL: https://zbmath.org/584617
https://doi.org/10.1002/malq.19920380133
https://onlinelibrary.wiley.com/doi/abs/10.1002/malq.19920380133
https://philpapers.org/rec/BIARIS
https://hdl.handle.net/11365/1082757
https://doi.org/10.1002/malq.19920380133

2024 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC Iowa State University Ames, IA, USA May 14–17, 2024.

Source: Bulletin of Symbolic Logic; Dec2024, Vol. 30 Issue 4, p547-579, 33p

Subject Terms: DISCRETE mathematics, MATHEMATICAL logic, PROBABILISTIC automata, PHILOSOPHY of science, MATHEMATICAL equivalence, KOLMOGOROV complexity, COMPUTABLE functions, BIPARTITE graphs, TOPOLOGICAL groups

Countability constraints in order-theoretic approaches to computability.

Source: Mathematical Structures in Computer Science; Jun2024, Vol. 34 Issue 6, p1-38, 38p

Subject Terms: TURING machines, RECURSION theory, DENSITY, MACHINERY

Arithmetical Foundations Recursion. Evaluation. Consistency Excerpt

Authors: Pfender, Michael

Subject Terms: 510 Mathematik, categorical logic, topoi, foundations of classical theories, abstract and axiomatic computability and recursion theory

File Description: application/pdf

Availability: https://depositonce.tu-berlin.de/handle/11303/15764
https://doi.org/10.14279/depositonce-14537

On Signifiable Computability: Part II: An Axiomatization of Signifiable Computation and Debugger Theorems.

Authors: Kulyukin, Vladimir A.

Source: Mathematics (2227-7390); Mar2025, Vol. 13 Issue 6, p934, 36p

Subject Terms: RECURSION theory, REAL numbers, COMPUTABLE functions, NUMBER theory, DATA structures

A pathological punctually 1-decidable structure.

Authors: Hammatt, Ellen Turetsky, Dan Melnikov, Alexander G. et al.

Source: Proceedings of the American Mathematical Society; Oct2025, Vol. 153 Issue 10, p4447-4462, 16p

Subject Terms: MATHEMATICAL logic, DECIDABILITY (Mathematical logic), RECURSION theory

Diagonal fixed points in algebraic recursion theory

Authors: Jordan Zashev

Source: Archive for Mathematical Logic. 44:973-994

Subject Terms: intensional combinatory space, algebraic recursion theory, Combinatory logic and lambda calculus, combinatory logic, 0101 mathematics, Abstract and axiomatic computability and recursion theory, 01 natural sciences, fixed-point theorems

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/aml/aml44.html#Zashev05
https://link.springer.com/content/pdf/10.1007%2Fs00153-005-0307-x.pdf
https://link.springer.com/article/10.1007/s00153-005-0307-x

Automata and Computability : A Programmer's Perspective

Authors: Ganesh Gopalakrishnan

Resource Type: eBook.

Subjects: Digital control systems--Programming, Automatic control--Data processing, Machine theory

Categories: COMPUTERS / General, COMPUTERS / Programming / Games, COMPUTERS / Information Theory, MATHEMATICS / General, MATHEMATICS / Combinatorics, TECHNOLOGY & ENGINEERING / Engineering (General)

Alpha-Structural Recursion and Induction.

Authors: Pitts, Andrew M.

Source: Journal of the ACM; May2006, Vol. 53 Issue 3, p459-506, 48p

Subject Terms: PERMUTATIONS, RECURSION theory, MATHEMATICAL induction, FINITE element method, COMPUTER programming

KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES: Knuth-Bendix for groups with infinitely many rules

Authors: Paul J. Sanders David B. A. Epstein

Source: International Journal of Algebra and Computation. 10:539-589

Subject Terms: Generators, relations, and presentations of groups, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Group Theory (math.GR), 0102 computer and information sciences, 20F10,20-04,68Q42 (Primary), solvable word problem, 01 natural sciences, regular languages, 03D40,20F32 (Secondary), finitely presented groups, Grammars and rewriting systems, FOS: Mathematics, Knuth-Bendix procedures, 0101 mathematics, finite state automata, Word problems, etc. in computability and recursion theory, Geometric group theory, automatic groups, Mathematics - Group Theory, word reductions

File Description: application/xml

Access URL: http://arxiv.org/pdf/math/0001035
http://arxiv.org/abs/math/0001035
https://zbmath.org/1845101
https://doi.org/10.1142/s0218196700000352
https://dblp.uni-trier.de/db/journals/ijac/ijac10.html#EpsteinS00
https://www.worldscientific.com/doi/10.1142/S0218196700000352

Categorial generalization of algebraic recursion theory

Authors: J. Zashev

Source: Journal of Pure and Applied Algebra. 101:91-128

Subject Terms: Logic in computer science, Algebra and Number Theory, least fixpoints, multi-endofunctors, operation spaces, category of logical programs and correctness proofs, Theories (e.g., algebraic theories), structure, and semantics, 0102 computer and information sciences, 01 natural sciences, fixpoints in categories, category of abstract programs and correctness proofs, point-free recursion theory, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Categorical logic, topoi

File Description: application/xml

Access URL: https://www.sciencedirect.com/science/article/pii/0022404993E01846

Exploring the philosophical perspectives of future robots.

Authors: Guilherme, Anthony Costa, José Félix

Source: International Journal of Parallel, Emergent & Distributed Systems; Jan2025, Vol. 40 Issue 1, p21-58, 38p

Subject Terms: PHILOSOPHY of science, SCIENTIFIC method, ARTIFICIAL intelligence, PRINCIPLE (Philosophy), MACHINE learning

Computability Theory & Automata Theory

Authors: Kristy Plante Tomas Jensen

Resource Type: eBook.

Subjects: Computer science, Computable functions, Machine theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity

Studies on Partial Impredicativity in Formal Systems of Arithmetic and Computability Theory.

Authors: Suzuki, Yudai

Source: Bulletin of Symbolic Logic; Jun2025, Vol. 31 Issue 2, p352-353, 2p

Subject Terms: REVERSE mathematics, RECURSION theory, MONOTONE operators, MATHEMATICAL logic, MATHEMATICS

A Rice’s Theorem for Abstract Semantics

Authors: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng et al.

Contributors: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng et al.

Subject Terms: Computability Theory, Recursive Function, Rice’s Theorem, Kleene’s Second Recursion Theorem, Program Analysis, Affine Program Invariants

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.117

Availability: https://doi.org/10.4230/LIPIcs.ICALP.2021.117
https://nbn-resolving.org/urn:nbn:de:0030-drops-141860
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.117

On totalisation of computable functions in a distributive environment.

Authors: Burgin, Mark Shtepel, Matan

Source: International Journal of Parallel, Emergent & Distributed Systems; May2022, Vol. 37 Issue 3, p273-291, 19p

Subject Terms: COMPUTABLE functions, AXIOMATIC set theory, COMPUTER networks, COMPUTER systems, SYSTEM failures, DISTRIBUTED algorithms, SYSTEMS theory

Separations by random oracles and 'Almost' classes for generalized reducibilities: Extended abstract

Authors: Yongge Wang Wolfgang Merkle

Source: Lecture Notes in Computer Science ISBN: 9783540602460

Subject Terms: Complexity of computation (including implicit computational complexity), measurable classes of sets, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), resource-bounded reducibilities, random oracles, almost classes, generalized reducibilities, 16. Peace & justice, Abstract and axiomatic computability and recursion theory

File Description: application/xml

Access URL: https://dialnet.unirioja.es/servlet/articulo?codigo=2805273
https://dblp.uni-trier.de/db/journals/mlq/mlq47.html#MerkleW01
https://link.springer.com/chapter/10.1007%2F3-540-60246-1_124
https://dblp.uni-trier.de/db/conf/mfcs/mfcs95.html#MerkleW95
https://philpapers.org/rec/WANSBR
https://math.uni-heidelberg.de/logic/merkle/final-versions/MLQ-almost.pdf
https://rd.springer.com/chapter/10.1007/3-540-60246-1_124