Výsledky vyhledávání - abstracts and ((axiomatic OR automatic) OR automation) computability and recursion theory

Execution trace sets for real computation

Autoři: Declan Thompson

Zdroj: Theoretical Computer Science. 940:2-17

Témata: 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

Popis souboru: application/xml

On Strong and Weak Logics for Paraconsistent Computability.

Autoři: Weber, Zach Cano-Jorge, Fernando

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

Témata: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES

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

Autoři: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Přispěvatelé: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Zdroj: Mathematical Logic Quarterly. 38:349-359

Témata: 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

Popis souboru: application/xml; application/pdf; STAMPA

Přístupová URL adresa: 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

Countability constraints in order-theoretic approaches to computability.

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

Témata: TURING machines, RECURSION theory, DENSITY, MACHINERY

Arithmetical Foundations Recursion. Evaluation. Consistency Excerpt

Autoři: Pfender, Michael

Témata: 510 Mathematik, categorical logic, topoi, foundations of classical theories, abstract and axiomatic computability and recursion theory

Popis souboru: application/pdf

Dostupnost: 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.

Autoři: Kulyukin, Vladimir A.

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

Témata: RECURSION theory, REAL numbers, COMPUTABLE functions, NUMBER theory, DATA structures

A pathological punctually 1-decidable structure.

Autoři: Hammatt, Ellen Turetsky, Dan Melnikov, Alexander G. a další

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

Témata: MATHEMATICAL logic, DECIDABILITY (Mathematical logic), RECURSION theory

Diagonal fixed points in algebraic recursion theory

Autoři: Jordan Zashev

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

Alpha-Structural Recursion and Induction.

Autoři: Pitts, Andrew M.

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

Témata: 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

Autoři: Paul J. Sanders David B. A. Epstein

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

Autoři: J. Zashev

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/0022404993E01846

Computability Theory & Automata Theory

Autoři: Kristy Plante Tomas Jensen

Resource Type: eBook.

Témata: Computer science, Computable functions, Machine theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity

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

Autoři: Suzuki, Yudai

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

Témata: REVERSE mathematics, RECURSION theory, MONOTONE operators, MATHEMATICAL logic, MATHEMATICS

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

Autoři: Yongge Wang Wolfgang Merkle

Zdroj: Lecture Notes in Computer Science ISBN: 9783540602460

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

Autoři: Ivanov, Lyubomir

Zdroj: Fundamenta Informaticae. 44:183-208

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1546506

Degrees of automata transformations

Autoři: Bajrasheva, V. R.

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3904569

On the recursion theorem in iterative operative spaces

Autoři: J. Zashev

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/jsyml/jsyml66.html#Zashev01
https://www.jstor.org/stable/2694971

Selection in abstract recursion theory

Autoři: David B. MacQueen Leo Harrington

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

Témata: Prime Computability, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Selection, Abstract Recursion Theory, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: 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

Lattice Embeddings for Abstract Bounded Reducibilities: Lattice embeddings for abstract bounded reducibilities

Autoři: Wolfgang Merkle

Zdroj: SIAM Journal on Computing. 31:1119-1155

Témata: Complexity of computation (including implicit computational complexity), Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), embeddings of partial orderings, resource-bounded reducibilities, abstract reducibilities, 0102 computer and information sciences, embeddings of distributive lattices, 0101 mathematics, Abstract and axiomatic computability and recursion theory, 01 natural sciences, Theory of numerations, effectively presented structures

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1732383
https://doi.org/10.1137/s0097539701385958
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#Merkle02
https://epubs.siam.org/doi/10.1137/S0097539701385958
https://doi.org/10.1137/S0097539701385958

Axiomatic recursion theory and the continuous functionals

Autoři: Simon Thompson

Zdroj: Journal of Symbolic Logic. 50:442-450

Témata: Higher-type and set recursion theory, Kleene computations, higher type computation theory, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, countable recursion, 15. Life on land, Abstract and axiomatic computability and recursion theory, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3946117
https://doi.org/10.2307/2274232
https://projecteuclid.org/handle/euclid.jsl/1183741850
https://www.jstor.org/stable/2274232
http://projecteuclid.org/handle/euclid.jsl/1183741850
https://dblp.uni-trier.de/db/journals/jsyml/jsyml50.html#Thompson85