Search Results - abstracts 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: 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
-
3
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
-
4
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 -
5
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
-
6
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
-
7
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 -
8
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
-
9
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
-
10
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
-
11
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 -
12
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
-
13
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 -
14
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
-
15
Authors: George Tourlakis
Source: Mathematical Logic Quarterly. 42:449-460
Subject Terms: oracle computations, Higher-type and set recursion theory, computable functional, model of computation, type-1 inputs, 0102 computer and information sciences, 0101 mathematics, Abstract and axiomatic computability and recursion theory, 01 natural sciences
File Description: application/xml
-
16
Authors:
Source: Awodey, S, Birkedal, L & Scott, D S 2002, 'Local realizability toposes and a modal logic for computability', Mathematical Structures in Computer Science, vol. 12, no. 3, pp. 319-334. https://doi.org/10.1017/S0960129502003675
Subject Terms: Topoi, partial combinatory algebras, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, FOS: Philosophy, ethics and religion, Philosophy, tripos, Combinatory logic and lambda calculus, realizability topos, 0101 mathematics, Modal logic (including the logic of norms), Abstract and axiomatic computability and recursion theory, Categorical logic, topoi, modal logic, Computer Science(all)
File Description: application/xml
Access URL: https://figshare.com/articles/journal_contribution/Local_Realizability_Toposes_and_a_Modal_Logic_for_Computability/6492164/files/11936567.pdf
https://zbmath.org/1799473
https://doi.org/10.1017/s0960129502003675
http://repository.cmu.edu/philosophy/72/
https://doi.org/10.1017/S0960129502003675
https://dblp.uni-trier.de/db/journals/mscs/mscs12.html#AwodeyBS02
https://kilthub.cmu.edu/articles/journal_contribution/Local_Realizability_Toposes_and_a_Modal_Logic_for_Computability/6492164/1
https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/local-realizability-toposes-and-a-modal-logic-for-computability /31CB99D5D9210A9716EF4E7DFD4A204C
https://dialnet.unirioja.es/servlet/articulo?codigo=677759
https://www.sciencedirect.com/science/article/pii/S157106610400101X
https://dblp.uni-trier.de/db/journals/entcs/entcs23.html#AwodeyBS99
https://www.sciencedirect.com/science/article/abs/pii/S157106610400101X
https://pure.au.dk/portal/en/publications/e21b7ece-dcf5-4d6a-84ef-6ab35a7f79f0
https://doi.org/10.1017/S0960129502003675 -
17
Authors: Stefano Stefani
Source: Journal of Symbolic Logic. 58:1251-1267
Subject Terms: recursion categories, Special categories, Other degrees and reducibilities in computability and recursion theory, reduction, relativization, 0101 mathematics, 16. Peace & justice, Abstract and axiomatic computability and recursion theory, 01 natural sciences
File Description: application/xml
Access URL: https://zbmath.org/515481
https://doi.org/10.2307/2275141
https://projecteuclid.org/euclid.jsl/1183744373
https://dblp.uni-trier.de/db/journals/jsyml/jsyml58.html#Stefani93
https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/relativization-mechanism-in-recursion -categories/D8511F8A71106E1F2CE2948613268E38 -
18
Authors: Armin Hemmerling
Source: Mathematical Logic Quarterly. 44:394-416
Subject Terms: effective codability, Turing machines and related notions, model of computation for string functions over abstract algebraic structures, arbitrary signatures, existence results, Models of computation (Turing machines, etc.), 0101 mathematics, Abstract and axiomatic computability and recursion theory, Blum-Shub-Smale model, 01 natural sciences
File Description: application/xml
-
19
Authors:
Source: Mathematical Structures in Computer Science. 4:295-313
Subject Terms: categorical framework for primitive recursion, primitive recursive theories, Special categories, primitive recursive categories, 0102 computer and information sciences, 0101 mathematics, Abstract and axiomatic computability and recursion theory, 01 natural sciences, Categorical logic, topoi
File Description: application/xml
Access URL: https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/primitive-
recursion -equality-and-a-universal-set/440DCC3C5326A5C0B5A0D37388B44438 -
20
Authors: Lawrence S. Moss
Source: Electronic Notes in Theoretical Computer Science. 20:413-432
Subject Terms: fixed-point equations, Logic in computer science, Applications of universal algebra in computer science, Iteration theory, Corecursion, 0102 computer and information sciences, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Equational logic, 01 natural sciences, final coalgebra, Theoretical Computer Science, Computer Science(all)
File Description: application/xml
Full Text Finder 
Nájsť tento článok vo Web of Science