Výsledky vyhledávání - "Abstract 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

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

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

Two situations with unit-cost: ordered abelian semi-groups and some commutative rings

Autoři: Mihai Prunescu

Zdroj: Journal of Complexity. 21:579-592

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

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/abs/pii/S0885064X04001050
https://dblp.uni-trier.de/db/journals/jc/jc21.html#Prunescu05
https://www.sciencedirect.com/science/article/pii/S0885064X04001050
https://core.ac.uk/display/82022774

Diagonal fixed points in algebraic recursion theory

Autoři: Jordan Zashev

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

Témata: 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 souboru: application/xml

Pří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

Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time: Implicit complexity over an arbitrary structure: sequential and parallel polynomial time

Autoři: Bournez, Olivier Cucker, Felipe Jacobé de Naurois, Paulin a další

Přispěvatelé: Bournez, Olivier Cucker, Felipe Jacobé de Naurois, Paulin a další

Zdroj: Journal of Logic and Computation. 15:41-58

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

Popis souboru: application/xml

Přístupová URL adresa: https://inria.hal.science/inria-00102942v1
https://hal.inria.fr/inria-00102942
https://dblp.uni-trier.de/db/journals/logcom/logcom15.html#BournezCNM05
https://academic.oup.com/logcom/article/15/1/41/950725

Computational Complexity in Algebraic Systems: Computational complexity in algebraic systems

Autoři: A. N. Rybalov

Zdroj: Siberian Mathematical Journal. 45:1113-1123

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

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/5041649
https://link.springer.com/article/10.1023%2FB%3ASIMJ.0000048927.31169.8d
https://link.springer.com/content/pdf/10.1023/B:SIMJ.0000048927.31169.8d.pdf

Decidability without mathematics

Autoři: Andrzej Grzegorczyk

Zdroj: Annals of Pure and Applied Logic. 126:309-312

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

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2083187
https://doi.org/10.1016/j.apal.2003.11.029
https://www.sciencedirect.com/science/article/pii/S0168007203001106
https://dblp.uni-trier.de/db/journals/apal/apal126.html#Grzegorczyk04
https://www.sciencedirect.com/science/article/abs/pii/S0168007203001106

Computational inductive definability

Autoři: Dexter Kozen

Zdroj: Annals of Pure and Applied Logic. 126:139-148

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

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2083177
https://doi.org/10.1016/j.apal.2003.10.013
https://dblp.uni-trier.de/db/journals/apal/apal126.html#Kozen04
https://www.sciencedirect.com/science/article/pii/S0168007203000988

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

Relative and modified relative realizability

Autoři: Birkedal, L. Oosten, J. van

Zdroj: Annals of Pure and Applied Logic. 118:115-132

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

Popis souboru: application/xml; application/pdf

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

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

Autoři: Wolfgang Merkle

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

Témata: 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 souboru: application/xml

Pří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

Iteration Theories of Synchronization Trees: Iteration theories of synchronization trees

Autoři: Stephen L. Bloom Zoltán Ésik Dirk Taubner

Zdroj: Workshops in Computing ISBN: 9783540196259

Témata: 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 souboru: application/xml

Pří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

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

Can partial indexings be totalized?

Autoři: Dieter Spreen

Zdroj: Journal of Symbolic Logic. 66:1157-1185

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

Popis souboru: application/xml

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

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

The unfolding of non-finitist arithmetic

Autoři: Thomas Strahm Solomon Feferman

Zdroj: Annals of Pure and Applied Logic. 104:75-96

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

Popis souboru: application/xml

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

Platek Spaces: Platek spaces

Autoři: Ivanov, Lyubomir

Zdroj: Fundamenta Informaticae. 44:145-181

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

Popis souboru: application/xml

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

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

Note on the generalization of calculations

Autoři: Matthias Baaz

Zdroj: Theoretical Computer Science. 224:3-11

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

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0304397598003041
https://dblp.uni-trier.de/db/journals/tcs/tcs224.html#Baaz99