Výsledky vyhľadávania - abstracts and (axiomatic OR automation) computability and recursion theory~

Execution trace sets for real computation

Autori: Declan Thompson

Zdroj: Theoretical Computer Science. 940:2-17

Predmety: 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 súboru: application/xml

REDUCIBILITY IN SOME CATEGORIES OF PARTIAL RECURSIVE OPERATORS: Reducibility in some categories of partial recursive operators

Autori: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Prispievatelia: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Zdroj: Mathematical Logic Quarterly. 38:349-359

Predmety: Categories of machines, automata, partial recursive operators, reducibility, 01 natural sciences, partial recursive operator, dominical categories, Recursion categories, recursion categories, completeness, dominical categorie, creativeness, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Theory of numerations, effectively presented structures, domains

Popis súboru: application/xml; application/pdf; STAMPA

Prístupová URL adresa: https://zbmath.org/584617
https://doi.org/10.1002/malq.19920380133
https://onlinelibrary.wiley.com/doi/abs/10.1002/malq.19920380133
https://philpapers.org/rec/BIARIS
https://hdl.handle.net/11365/1082757
https://doi.org/10.1002/malq.19920380133

On Strong and Weak Logics for Paraconsistent Computability.

Autori: Weber, Zach Cano-Jorge, Fernando

Zdroj: Journal of Applied Logics- IfCoLog Journal of Logics & their Applications (FLAP); Jun2025, Vol. 12 Issue 5, p1349-1381, 33p

Predmety: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES

Countability constraints in order-theoretic approaches to computability.

Zdroj: Mathematical Structures in Computer Science; Jun2024, Vol. 34 Issue 6, p1-38, 38p

Predmety: TURING machines, RECURSION theory, DENSITY, MACHINERY

Diagonal fixed points in algebraic recursion theory

Autori: Jordan Zashev

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

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

Popis súboru: application/xml

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

Arithmetical Foundations Recursion. Evaluation. Consistency Excerpt

Autori: Pfender, Michael

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

Popis súboru: application/pdf

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

Categorial generalization of algebraic recursion theory

Autori: J. Zashev

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

Predmety: 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 súboru: application/xml

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

Degrees of automata transformations

Autori: Bajrasheva, V. R.

Predmety: category methods in recursion theory, Other degrees and reducibilities in computability and recursion theory, Formal languages and automata, Automata and formal grammars in connection with logical questions, Abstract and axiomatic computability and recursion theory, complete degrees

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/3904569

On Signifiable Computability: Part II: An Axiomatization of Signifiable Computation and Debugger Theorems.

Autori: Kulyukin, Vladimir A.

Zdroj: Mathematics (2227-7390); Mar2025, Vol. 13 Issue 6, p934, 36p

Predmety: RECURSION theory, REAL numbers, COMPUTABLE functions, NUMBER theory, DATA structures

Selection in abstract recursion theory

Autori: David B. MacQueen Leo Harrington

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

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

Popis súboru: application/xml

Prí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

Autori: Simon Thompson

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

Predmety: 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 súboru: application/xml

Prí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

Autori: Yongge Wang Wolfgang Merkle

Zdroj: Lecture Notes in Computer Science ISBN: 9783540602460

Predmety: 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 súboru: application/xml

Prí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

Autori: Ivanov, Lyubomir

Zdroj: Fundamenta Informaticae. 44:183-208

Predmety: 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 súboru: application/xml

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

On the recursion theorem in iterative operative spaces

Autori: J. Zashev

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

Predmety: 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 súboru: application/xml

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

Autori: Wolfgang Merkle

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

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

Popis súboru: application/xml

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

Autori: Solomon Feferman

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

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

Popis súboru: application/xml

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

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

Autori: Suzuki, Yudai

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

Predmety: REVERSE mathematics, RECURSION theory, MONOTONE operators, MATHEMATICAL logic, MATHEMATICS

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

Autori: Florian Lengyel

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

Predmety: 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 súboru: application/xml

Axioms and (counter)examples in synthetic domain theory

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

Predmety: 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 súboru: application/xml; application/pdf

Prí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

Iteration Theories of Synchronization Trees: Iteration theories of synchronization trees

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

Zdroj: Workshops in Computing ISBN: 9783540196259

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

Popis súboru: application/xml

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