Search Results - ((abstrakty OR abstraktys) OR abstracts) and axiomatic computability and recursion theory
-
1
Authors: Ivanov, Ljubomir L.
Source: The Journal of Symbolic Logic, 1989 Mar 01. 54(1), 16-25.
Access URL: https://www.jstor.org/stable/2275011
-
2
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
-
3
Authors: Grabmayr, Balthasar1 (AUTHOR) balthasar.grabmayr@uni-tuebingen.de
Source: Nous (0029-4624). Dec2025, p1. 13p.
Subject Terms: *ARITHMETIC, *NUMBER systems, *COMPUTER systems, *RECURSION theory, *MATHEMATICS, *FORMAL languages
-
4
Authors: Wagner, Eric G.
Source: Transactions of the American Mathematical Society, 1969 Oct 01. 144, 1-41.
Access URL: https://www.jstor.org/stable/1995267
-
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: 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
-
7
Authors: Duvalier, Matthew
Subject Terms: Logic, Theoretical mathematics, Mathematics
File Description: application/pdf
-
8
Authors: Jens E. Fenstad
Resource Type: eBook.
Subjects: Recursion theory
Categories: MATHEMATICS / Logic
-
9
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
-
10
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
-
11
Source: Mathematical Structures in Computer Science; Jun2024, Vol. 34 Issue 6, p1-38, 38p
Subject Terms: TURING machines, RECURSION theory, DENSITY, MACHINERY
-
12
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 -
13
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
-
14
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
-
15
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 -
16
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
-
17
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
-
18
Authors: Florian Lengyel
Source: Annals of Pure and Applied Logic. 125:1-41
Subject Terms: Computability, \(P\)-category, Logic, Special categories, Recursion category, 0102 computer and information sciences, 01 natural sciences, Coalgebra, Foundations, relations to logic and deductive systems, Turing morphism, 0101 mathematics, P-category, Abstract and axiomatic computability and recursion theory, Categorical logic, topoi
File Description: application/xml
-
19
Authors: Solomon Feferman
Source: Annals of Pure and Applied Logic. 81:75-113
Subject Terms: general theory of computation, Logic, generalized recursion theory, 0102 computer and information sciences, many-sorted functional structures, 0101 mathematics, Symbolic computation and algebraic computation, Abstract and axiomatic computability and recursion theory, 01 natural sciences, \(A\)-stream computation, Abstract data types, algebraic specification, abstract data types
File Description: application/xml
Access URL: https://zbmath.org/933091
https://doi.org/10.1016/0168-0072(96)88189-9
http://math.stanford.edu/~feferman/papers/streams.pdf
https://www.sciencedirect.com/science/article/abs/pii/0168007296881899
https://dblp.uni-trier.de/db/journals/apal/apal81.html#Feferman96
https://www.sciencedirect.com/science/article/pii/0168007296881899
https://core.ac.uk/display/82118781 -
20
Authors:
Source: Workshops in Computing ISBN: 9783540196259
Subject Terms: Logic in computer science, synchronization theories, branching time semantics, Semantics in the theory of computing, synchronization trees, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), \(\omega\)-continuous 2-theory, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Computer Science Applications, bisimulation equivalence classes, Computational Theory and Mathematics, 0101 mathematics, Abstract and axiomatic computability and recursion theory, iteration theories, Information Systems
File Description: application/xml
Nájsť tento článok vo Web of Science 
Full Text Finder