Search Results - "Abstract AND axiomatic 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: Pfender, Michael
Subject Terms: 510 Mathematik, categorical logic, topoi, foundations of classical theories, abstract and axiomatic computability and recursion theory
File Description: application/pdf
-
3
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 -
4
Authors: Mihai Prunescu
Source: Journal of Complexity. 21:579-592
Subject Terms: arithmetical hierarchy, Statistics and Probability, unit-cost complexity, Control and Optimization, 0102 computer and information sciences, 01 natural sciences, Arithmetic hierarchy, P vs. NP, Complexity classes (hierarchies, relations among complexity classes, etc.), polynomial hierarchy, Unit-cost, 0101 mathematics, Products of rings, products of rings, Complexity of computation (including implicit computational complexity), Numerical Analysis, Axioms, Algebra and Number Theory, ordered abelian semigroups, Applied Mathematics, Model-theoretic algebra, complexity classes, Bit-cost, algebraic knapsack problem, Computation, Turing machines and related notions, Ordered semigroups and monoids, Ordered abelian semi-group, Abstract and axiomatic computability and recursion theory, Polynomial hierarchy
File Description: application/xml
-
5
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
-
6
Authors: et al.
Contributors: et al.
Source: Journal of Logic and Computation. 15:41-58
Subject Terms: function algebras, implicit complexity, Complexity of computation (including implicit computational complexity), complexity theory, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Shub, Smale model, Complexity classes (hierarchies, relations among complexity classes, etc.), [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Blum, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Blum-Shub-Smale model
File Description: application/xml
-
7
Authors: A. N. Rybalov
Source: Siberian Mathematical Journal. 45:1113-1123
Subject Terms: generalized computability, Complexity of computation (including implicit computational complexity), BSS-machines, complexity of computations, Complexity classes (hierarchies, relations among complexity classes, etc.), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0102 computer and information sciences, 0101 mathematics, Abstract and axiomatic computability and recursion theory, 01 natural sciences
File Description: application/xml
-
8
Authors: Andrzej Grzegorczyk
Source: Annals of Pure and Applied Logic. 126:309-312
Subject Terms: computability, representability, elementary theory of texts, name discernibility, Logic, concatenation, decidability, Undecidability and degrees of sets of sentences, 0101 mathematics, Abstract and axiomatic computability and recursion theory, recursiveness, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies
File Description: application/xml
-
9
Authors: Dexter Kozen
Source: Annals of Pure and Applied Logic. 126:139-148
Subject Terms: Inductive definability, IND programs, Logic, Hereditarily finite sets, 0102 computer and information sciences, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Descriptive set theory, 01 natural sciences, Computability and recursion theory on ordinals, admissible sets, etc
File Description: application/xml
-
10
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
-
11
Authors:
Source: Annals of Pure and Applied Logic. 118:115-132
Subject Terms: Topoi, Logic, partial combinatory algebras, Sierpiński topos, Wiskunde en computerwetenschappen, ralizability topos, Realizability toposes, Intuitionistic mathematics, Internal partial combinatory algebras, modified realizability, relative realizability, Wiskunde: algemeen, Combinatory logic and lambda calculus, Abstract and axiomatic computability and recursion theory, Wiskunde en Informatica, Other mathematical specialities, Categorical logic, topoi
File Description: application/xml; application/pdf
Access URL: https://zbmath.org/1838868
https://doi.org/10.1016/s0168-0072(01)00122-1
https://research-portal.uu.nl/en/publications/a97161d1-9ea6-442a-a09e-05e8bb9d1b9d
https://philpapers.org/rec/BIRRAM-2
https://www.sciencedirect.com/science/article/pii/S0168007201001221
https://dblp.uni-trier.de/db/journals/apal/apal118.html#BirkedalO02
https://www.narcis.nl/publication/RecordID/oai%3Adspace.library.uu.nl%3A1874%2F1925
https://dspace.library.uu.nl/handle/1874/1925 -
12
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
-
13
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
-
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: Dieter Spreen
Source: Journal of Symbolic Logic. 66:1157-1185
Subject Terms: constructive domain, total numbering, total indexing, domain, 8. Economic growth, 0102 computer and information sciences, 0101 mathematics, effective topological space, 16. Peace & justice, Abstract and axiomatic computability and recursion theory, 01 natural sciences, Theory of numerations, effectively presented structures
File Description: application/xml
Access URL: https://zbmath.org/1679324
https://doi.org/10.2307/2695099
https://projecteuclid.org/euclid.jsl/1183746552
https://dblp.uni-trier.de/db/journals/jsyml/jsyml66.html#Spreen01
http://core.ac.uk/display/24274583
https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/can-partial-indexings-be-totalized/491A80F35ED187ED16C3A76385E4FE59 -
16
Authors:
Source: Oosten, J V & Simpson, A 2000, ' Axioms and (counter)examples in synthetic domain theory ', Annals of Pure and Applied Logic, vol. 104, no. 1?3, pp. 233-278 . https://doi.org/10.1016/S0168-0072(00)00014-2
Subject Terms: categories of domains, Topoi, internal logic, Logic, Wiskunde en computerwetenschappen, Semantics in the theory of computing, Topos theory, synthetic domain theory, Realizability, Categorical semantics of formal languages, Wiskunde: algemeen, elementary topos, Wiskunde en Informatica (WIIN), Abstract and axiomatic computability and recursion theory, Wiskunde en Informatica, Other mathematical specialities, Synthetic domain theory, Categorical logic, topoi
File Description: application/xml; application/pdf
Access URL: https://zbmath.org/1501508
https://doi.org/10.1016/s0168-0072(00)00014-2
https://research-portal.uu.nl/en/publications/437cadf2-243a-46e9-847d-611eb6a0e16d
https://www.sciencedirect.com/science/article/abs/pii/S0168007200000142
https://dblp.uni-trier.de/db/journals/apal/apal104.html#OostenS00
https://philpapers.org/rec/VANAAC-3
https://www.research.ed.ac.uk/portal/en/publications/axioms-and-counterexamples-in-synthetic-domain-theory (0db25dcc-7508-4cc3-ae6d-c575797be9b2)/export.html
https://www.narcis.nl/publication/RecordID/oai%3Adspace.library.uu.nl%3A1874%2F2357
http://www.research.ed.ac.uk/portal/en/publications/axioms-and-counterexamples-in-synthetic-domain-theory (0db25dcc-7508-4cc3-ae6d-c575797be9b2)/export.html
https://hdl.handle.net/20.500.11820/0db25dcc-7508-4cc3-ae6d-c575797be9b2
https://www.pure.ed.ac.uk/ws/files/12306183/1_s2.0_S0168007200000142_main.pdf
https://dspace.library.uu.nl/handle/1874/2357 -
17
Authors:
Source: Annals of Pure and Applied Logic. 104:75-96
Subject Terms: Non-finitist arithmetic, First-order arithmetic and fragments, Proof theory in general (including proof-theoretic semantics), Logic, Schematic formal systems, Generalized recursion theory, generalized recursion theory, proof-theoretic analysis, unfolding of schematic formal systems, 06 humanities and the arts, 0603 philosophy, ethics and religion, 01 natural sciences, non-finitist arithmetic, Higher-type and set recursion theory, Predicative analysis, 0101 mathematics, predicative analysis, Abstract and axiomatic computability and recursion theory
File Description: application/xml
Access URL: https://zbmath.org/1501502
https://doi.org/10.1016/s0168-0072(00)00008-7
https://dblp.uni-trier.de/db/journals/apal/apal104.html#FefermanS00
http://www.sciencedirect.com/science/article/pii/S0168007200000087
http://math.stanford.edu/~feferman/papers/unfolding.pdf
https://philpapers.org/rec/FEFTUO
https://www.sciencedirect.com/science/article/pii/S0168007200000087#! -
18
Authors: Ivanov, Lyubomir
Source: Fundamenta Informaticae. 44:145-181
Subject Terms: computability, combinatory algebra, Platek spaces, lightface recursion, recursion theory on monotonic hierarchies of operative spaces, generalized recursion theory, Abstract and axiomatic computability and recursion theory
File Description: application/xml
Access URL: https://zbmath.org/1546505
-
19
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
-
20
Authors: Matthias Baaz
Source: Theoretical Computer Science. 224:3-11
Subject Terms: Primality, calculation tree, unification, Generalization, Fermat number, Calculation, 0102 computer and information sciences, 06 humanities and the arts, Symbolic computation and algebraic computation, 0603 philosophy, ethics and religion, 01 natural sciences, Theoretical Computer Science, Mechanization of proofs and logical operations, Basic properties of first-order languages and structures, abstract calculation, abstractions of calculation steps, Factorization, primality, Abstract and axiomatic computability and recursion theory, Computer Science(all)
File Description: application/xml
Full Text Finder 
Nájsť tento článok vo Web of Science