Search Results - abstracts AND ((axiomatic OR automatic) OR automation) computability AND recursion theory~
-
1
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
-
2
Authors:
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
-
3
Authors:
Contributors:
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
-
4
Source: Mathematical Structures in Computer Science; Jun2024, Vol. 34 Issue 6, p1-38, 38p
Subject Terms: TURING machines, RECURSION theory, DENSITY, MACHINERY
-
5
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
-
6
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
-
7
Authors: 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
-
8
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
-
9
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
-
10
Authors:
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
-
11
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
-
12
Authors:
Resource Type: eBook.
Subjects: Computer science, Computable functions, Machine theory
Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity
-
13
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
-
14
Separations by random oracles and 'Almost' classes for generalized reducibilities: Extended abstract
Authors:
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 -
15
Authors: Ivanov, Lyubomir
Source: Fundamenta Informaticae. 44:183-208
Subject Terms: 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
File Description: application/xml
Access URL: https://zbmath.org/1546506
-
16
Authors: Bajrasheva, V. R.
Subject Terms: 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
File Description: application/xml
Access URL: https://zbmath.org/3904569
-
17
Authors: J. Zashev
Source: Journal of Symbolic Logic. 66:1727-1748
Subject Terms: 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
File Description: application/xml
-
18
Authors:
Source: The Journal of Symbolic Logic. 41:153-158
Subject Terms: Prime Computability, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Selection, Abstract Recursion Theory, 01 natural sciences
File Description: application/xml
Access 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 -
19
Authors: Wolfgang Merkle
Source: SIAM Journal on Computing. 31:1119-1155
Subject Terms: 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
File Description: application/xml
-
20
Authors: Simon Thompson
Source: Journal of Symbolic Logic. 50:442-450
Subject Terms: 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
File Description: application/xml
Full Text Finder 
Nájsť tento článok vo Web of Science