Suchergebnisse - ((abstract OR astrally) OR abstraktu) and axiomatic computability and recursion theory

Execution trace sets for real computation

Autoren: Declan Thompson

Quelle: Theoretical Computer Science. 940:2-17

Schlagwörter: 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

Dateibeschreibung: application/xml

Abstract Hierarchies and Degrees

Autoren: Ivanov, Ljubomir L.

Quelle: The Journal of Symbolic Logic, 1989 Mar 01. 54(1), 16-25.

Zugangs-URL: https://www.jstor.org/stable/2275011

Diagonal fixed points in algebraic recursion theory

Autoren: Jordan Zashev

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: 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

Structure and Computation.

Autoren: Grabmayr, Balthasar¹ (AUTHOR) balthasar.grabmayr@uni-tuebingen.de

Quelle: Nous (0029-4624). Dec2025, p1. 13p.

Schlagwörter: *ARITHMETIC, *NUMBER systems, *COMPUTER systems, *RECURSION theory, *MATHEMATICS, *FORMAL languages

Axiomatic recursion theory and the continuous functionals

Autoren: Simon Thompson

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: 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

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

Autoren: Yongge Wang Wolfgang Merkle

Quelle: Lecture Notes in Computer Science ISBN: 9783540602460

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-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

Boldface Recursion on Platek Spaces: Boldface recursion on Platek spaces

Autoren: Ivanov, Lyubomir

Quelle: Fundamenta Informaticae. 44:183-208

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1546506

On the recursion theorem in iterative operative spaces

Autoren: J. Zashev

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/jsyml/jsyml66.html#Zashev01
https://www.jstor.org/stable/2694971

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

Autoren: Wolfgang Merkle

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: 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

Computation on abstract data types. The extensional approach, with an application to streams

Autoren: Solomon Feferman

Quelle: Annals of Pure and Applied Logic. 81:75-113

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-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

Axioms and (counter)examples in synthetic domain theory

Autoren: Oosten, J. van Simpson, A.K.

Quelle: 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

Schlagwörter: 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

Dateibeschreibung: application/xml; application/pdf

Zugangs-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

Iteration Theories of Synchronization Trees: Iteration theories of synchronization trees

Autoren: Stephen L. Bloom Zoltán Ésik Dirk Taubner

Quelle: Workshops in Computing ISBN: 9783540196259

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/chapter/10.1007/978-1-4471-3860-0_7
https://www.sciencedirect.com/science/article/pii/S0890540183710011
https://core.ac.uk/display/82705390
https://rd.springer.com/chapter/10.1007/978-1-4471-3860-0_7

Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles: Recursion in partial type-1 objects with well-behaved oracles

Autoren: George Tourlakis

Quelle: Mathematical Logic Quarterly. 42:449-460

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/mlq/mlq42.html#Tourlakis96

Local Realizability Toposes and a Modal Logic for Computability: Local realizability toposes and a modal logic for computability

Autoren: Awodey, Steven Birkedal, Lars Scott, Dana S.

Quelle: 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

Schlagwörter: 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)

Dateibeschreibung: application/xml

Zugangs-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

Computability Over Structures of Infinite Signature: Computability over structures of infinite signature

Autoren: Armin Hemmerling

Quelle: Mathematical Logic Quarterly. 44:394-416

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/mlq/mlq44.html#Hemmerling98a
https://onlinelibrary.wiley.com/doi/10.1002/malq.19980440311

Primitive recursion, equality, and a universal set

Autoren: M. Kröplin M. Pfender D. Pape

Quelle: Mathematical Structures in Computer Science. 4:295-313

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/primitive-recursion-equality-and-a-universal-set/440DCC3C5326A5C0B5A0D37388B44438

Deterministic and nondeterministic computation, and horn programs, on abstract data types: Deterministic and nondeterministic computation, and Horn programs, on abstract data types

Autoren: John V. Tucker Jeffery I. Zucker

Quelle: The Journal of Logic Programming. 13:23-55

Schlagwörter: Logic in artificial intelligence, Applications of universal algebra in computer science, Horn programs, definability of relations on abstract structures, Logic, semicomputability, partial computable functions, 0102 computer and information sciences, computability over abstract structures, 0101 mathematics, Abstract and axiomatic computability and recursion theory, 01 natural sciences, Abstract data types, algebraic specification

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/39272
https://doi.org/10.1016/0743-1066(92)90020-4
https://dblp.uni-trier.de/db/journals/jlp/jlp13.html#TuckerZ92
https://www.sciencedirect.com/science/article/pii/0743106692900204
https://core.ac.uk/display/82252787
http://www.sciencedirect.com/science/article/pii/0743106692900204

Computational foundations of basic recursive function theory

Autoren: Robert L. Constable Scott F. Smith

Quelle: Theoretical Computer Science. 121:89-112

Schlagwörter: constructive type theory, parallel computing, unsolvability, Nuprl, 0102 computer and information sciences, Other constructive mathematics, 01 natural sciences, Theoretical Computer Science, Mechanization of proofs and logical operations, indexing-free theory of computing, fixed point rule, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://ecommons.cornell.edu/bitstream/1813/6744/1/88-904.pdf
https://zbmath.org/501165
https://doi.org/10.1016/0304-3975(93)90085-8
https://www.sciencedirect.com/science/article/pii/0304397593900858
https://doi.org/10.1016/0304-3975(93)90085-8
https://dblp.uni-trier.de/db/journals/tcs/tcs121.html#ConstableS93
https://core.ac.uk/display/82605020
http://www.sciencedirect.com/science/article/pii/0304397593900858
https://ieeexplore.ieee.org/document/5133/
https://www.cs.cornell.edu/courses/CS6110/2015sp/docs/constable-smith-BRFT.pdf
https://dblp.uni-trier.de/db/conf/lics/lics88.html#ConstableS88

Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic

Autoren: Franco Montagna Robert A. Di Paola

Quelle: Journal of Symbolic Logic. 56:643-660

Schlagwörter: \(p\)-recursion categories, recursively enumerable extensions of Peano arithmetic, Special categories, dominical categories, formal provability, 16. Peace & justice, Abstract and axiomatic computability and recursion theory, generalized first Gödel incompleteness theorem, Proof theory and constructive mathematics

Dateibeschreibung: application/xml

Zugangs-URL: https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/some-properties-of-the-syntactic-precursion-categories-generated-by-consistent-recursively-enumerable-extensions-of-peano-arithmetic/CEBD30B1664AF179CF873E007F2113F8
https://philpapers.org/rec/DIPSPO
https://dblp.uni-trier.de/db/journals/jsyml/jsyml56.html#PaolaM91

Dominical categories: recursion theory without elements: Dominical categories: Recursion theory without elements

Autoren: Robert A. Di Paola Alex Heller

Quelle: Journal of Symbolic Logic. 52:594-635

Schlagwörter: Gödel's incompleteness theorem, Rice's theorem, dominical categories, 0102 computer and information sciences, 0101 mathematics, algebraization, Abstract and axiomatic computability and recursion theory, abstract formulation of recursion theory, dominical recursion theory, 01 natural sciences, Categorical logic, topoi

Dateibeschreibung: application/xml

Zugangs-URL: https://philpapers.org/rec/PAODCR
https://dblp.uni-trier.de/db/journals/jsyml/jsyml52.html#PaolaH87
https://projecteuclid.org/euclid.jsl/1183742431
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0022481200029649
https://www.cambridge.org/core/product/identifier/S0022481200029649/type/journal_article
http://projecteuclid.org/euclid.jsl/1183742431