Suchergebnisse - abstracts and ((axiomatic OR automation) OR automatizace) computability and recursion theory*

Execution trace sets for real computation

Autoren: Declan Thompson

Quelle: Theoretical Computer Science. 940:2-17

Schlagwörter: 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

Dateibeschreibung: application/xml

On Strong and Weak Logics for Paraconsistent Computability.

Autoren: Weber, Zach Cano-Jorge, Fernando

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

Schlagwörter: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES

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

Autoren: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Weitere Verfasser: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Quelle: Mathematical Logic Quarterly. 38:349-359

Schlagwörter: 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

Dateibeschreibung: application/xml; application/pdf; STAMPA

Zugangs-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

Structure and Computation.

Autoren: Grabmayr, Balthasar¹ (AUTHOR) balthasar.grabmayr@uni-tuebingen.de

Quelle: Nous (0029-4624). Dec2025, p1. 13p.

Schlagwörter: *ARITHMETIC, *NUMBER systems, *COMPUTER systems, *RECURSION theory, *MATHEMATICS, *FORMAL languages

Countability constraints in order-theoretic approaches to computability.

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

Schlagwörter: TURING machines, RECURSION theory, DENSITY, MACHINERY

Arithmetical Foundations Recursion. Evaluation. Consistency Excerpt

Autoren: Pfender, Michael

Schlagwörter: 510 Mathematik, categorical logic, topoi, foundations of classical theories, abstract and axiomatic computability and recursion theory

Dateibeschreibung: application/pdf

Verfügbarkeit: 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.

Autoren: Kulyukin, Vladimir A.

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

Schlagwörter: RECURSION theory, REAL numbers, COMPUTABLE functions, NUMBER theory, DATA structures

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

Autoren: Qiu, Siyuan Xu, Jianfeng

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

Schlagwörter: MODEL theory, INFORMATION theory, SEMANTICS, MATHEMATICAL logic

Diagonal fixed points in algebraic recursion theory

Autoren: Jordan Zashev

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-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

Categorial generalization of algebraic recursion theory

Autoren: J. Zashev

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

Schlagwörter: 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

Dateibeschreibung: application/xml

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

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

Autoren: Suzuki, Yudai

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

Schlagwörter: REVERSE mathematics, RECURSION theory, MONOTONE operators, MATHEMATICAL logic, MATHEMATICS

A Rice’s Theorem for Abstract Semantics

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

Weitere Verfasser: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng et al.

Schlagwörter: Computability Theory, Recursive Function, Rice’s Theorem, Kleene’s Second Recursion Theorem, Program Analysis, Affine Program Invariants

Dateibeschreibung: 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

Verfügbarkeit: 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.

Autoren: Burgin, Mark Shtepel, Matan

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

Schlagwörter: COMPUTABLE functions, AXIOMATIC set theory, COMPUTER networks, COMPUTER systems, SYSTEM failures, DISTRIBUTED algorithms, SYSTEMS theory

Computable classifications of continuous, transducer, and regular functions.

Autoren: Franklin, Johanna N.Y. Hölzl, Rupert Melnikov, Alexander et al.

Quelle: Theoretical Computer Science. Mar2025, Vol. 1032, pN.PAG-N.PAG. 1p.

Schlagwörter: *RECURSION theory, *BANACH spaces, *CONTINUOUS functions, *TRANSDUCERS, *CLASSIFICATION

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

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

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

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

Autoren: Yongge Wang Wolfgang Merkle

Quelle: Lecture Notes in Computer Science ISBN: 9783540602460

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-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

Boldface Recursion on Platek Spaces: Boldface recursion on Platek spaces

Autoren: Ivanov, Lyubomir

Quelle: Fundamenta Informaticae. 44:183-208

Schlagwörter: computability, combinatory algebra, Platek spaces, models of a typed lambda-mu calculus, monotonic hierarchies of operative spaces, Combinatory logic and lambda calculus, boldface recursion, generalized recursion theory, lambda-abstraction, Abstract and axiomatic computability and recursion theory

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1546506

Degrees of automata transformations

Autoren: Bajrasheva, V. R.

Schlagwörter: category methods in recursion theory, Other degrees and reducibilities in computability and recursion theory, Formal languages and automata, Automata and formal grammars in connection with logical questions, Abstract and axiomatic computability and recursion theory, complete degrees

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3904569

On the recursion theorem in iterative operative spaces

Autoren: J. Zashev

Quelle: Journal of Symbolic Logic. 66:1727-1748

Schlagwörter: algebraic recursion theory, iterative operative spaces, abstract partially ordered algebras, Combinatory logic and lambda calculus, recursion theorem, 0102 computer and information sciences, combinatory logic, 0101 mathematics, 16. Peace & justice, 10. No inequality, Abstract and axiomatic computability and recursion theory, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/jsyml/jsyml66.html#Zashev01
https://www.jstor.org/stable/2694971

Selection in abstract recursion theory

Autoren: David B. MacQueen Leo Harrington

Quelle: The Journal of Symbolic Logic. 41:153-158

Schlagwörter: Prime Computability, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Selection, Abstract Recursion Theory, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3636014
https://doi.org/10.2307/2272954
https://dblp.uni-trier.de/db/journals/jsyml/jsyml41.html#HarringtonM76
https://www.cambridge.org/core/product/identifier/S0022481200051847/type/journal_article
https://philpapers.org/rec/HARSIA-2
https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/selection-in-abstract-recursion-theory/56BD15204AB479AEC673AA845BE8F7F9
https://www.jstor.org/stable/2272954