Výsledky vyhledávání - ((abstract OR abstractss) OR abstrakty) and axiomatic computability and recursion theory

Execution trace sets for real computation

Autoři: Declan Thompson

Zdroj: Theoretical Computer Science. 940:2-17

Témata: 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

Popis souboru: application/xml

Abstract Hierarchies and Degrees

Autoři: Ivanov, Ljubomir L.

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

Přístupová URL adresa: https://www.jstor.org/stable/2275011

Arithmetical Foundations Recursion. Evaluation. Consistency Excerpt

Autoři: Pfender, Michael

Témata: 510 Mathematik, categorical logic, topoi, foundations of classical theories, abstract and axiomatic computability and recursion theory

Popis souboru: application/pdf

Dostupnost: https://depositonce.tu-berlin.de/handle/11303/15764
https://doi.org/10.14279/depositonce-14537

Categorial generalization of algebraic recursion theory

Autoři: J. Zashev

Zdroj: Journal of Pure and Applied Algebra. 101:91-128

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/0022404993E01846

Structure and Computation.

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

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

Témata: *ARITHMETIC, *NUMBER systems, *COMPUTER systems, *RECURSION theory, *MATHEMATICS, *FORMAL languages

Selection in abstract recursion theory

Autoři: David B. MacQueen Leo Harrington

Zdroj: The Journal of Symbolic Logic. 41:153-158

Témata: Prime Computability, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Selection, Abstract Recursion Theory, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: 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

Axiomatic recursion theory and the continuous functionals

Autoři: Simon Thompson

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

Autoři: Yongge Wang Wolfgang Merkle

Zdroj: Lecture Notes in Computer Science ISBN: 9783540602460

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

Autoři: Ivanov, Lyubomir

Zdroj: Fundamenta Informaticae. 44:183-208

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1546506

On the recursion theorem in iterative operative spaces

Autoři: J. Zashev

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/jsyml/jsyml66.html#Zashev01
https://www.jstor.org/stable/2694971

More existence theorems for recursion categories: More existence theorems for recursion categories.

Autoři: Florian Lengyel

Zdroj: Annals of Pure and Applied Logic. 125:1-41

Témata: 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

Popis souboru: application/xml

Studies on Partial Impredicativity in Formal Systems of Arithmetic and Computability Theory.

Autoři: Suzuki, Yudai

Zdroj: Bulletin of Symbolic Logic; Jun2025, Vol. 31 Issue 2, p352-353, 2p

Témata: REVERSE mathematics, RECURSION theory, MONOTONE operators, MATHEMATICAL logic, MATHEMATICS

Axioms and (counter)examples in synthetic domain theory

Autoři: Oosten, J. van Simpson, A.K.

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

Témata: 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

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: 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

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

Autoři: Awodey, Steven Birkedal, Lars Scott, Dana S.

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

Témata: 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)

Popis souboru: application/xml

Přístupová URL adresa: 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

Autoři: Armin Hemmerling

Zdroj: Mathematical Logic Quarterly. 44:394-416

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/mlq/mlq44.html#Hemmerling98a
https://onlinelibrary.wiley.com/doi/10.1002/malq.19980440311

Recursion and Corecursion Have the Same Equational Logic: Recursion and corecursion have the same equational logic

Autoři: Lawrence S. Moss

Zdroj: Electronic Notes in Theoretical Computer Science. 20:413-432

Témata: 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)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1956192
https://doi.org/10.1016/s0304-3975(01)00242-0
https://dblp.uni-trier.de/db/journals/tcs/tcs294.html#Moss03
https://www.sciencedirect.com/science/article/pii/S0304397501002420
https://www.sciencedirect.com/science/article/abs/pii/S0304397501002420

A relativization mechanism in recursion categories

Autoři: Stefano Stefani

Zdroj: Journal of Symbolic Logic. 58:1251-1267

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

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

Autoři: John V. Tucker Jeffery I. Zucker

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

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

Autoři: Franco Montagna Robert A. Di Paola

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

Témata: \(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

Popis souboru: application/xml

Přístupová URL adresa: 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

The Theory of Computability Developed in Terms of Satisfaction: The theory of computability developed in terms of satisfaction

Autoři: Cain, James

Zdroj: Notre Dame J. Formal Logic 40, no. 4 (1999), 515-532

Témata: computability, 03Dxx, satisfaction, Gödel numberings and issues of incompleteness, 03F40, Philosophical and critical aspects of logic and foundations, Abstract and axiomatic computability and recursion theory, theory of truth

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://zbmath.org/1735694
https://doi.org/10.1305/ndjfl/1012429716
https://projecteuclid.org/euclid.ndjfl/1012429716
https://philpapers.org/rec/JAMTTO-4
https://dblp.uni-trier.de/db/journals/ndjfl/ndjfl40.html#Cain99
https://philpapers.org/archive/JAMTTO-4.pdf
https://projecteuclid.org/download/pdf_1/euclid.ndjfl/1012429716
https://projecteuclid.org/euclid.ndjfl/1012429716