-
1Academic Journal
المؤلفون: J. V. Tucker
المساهمون: The Pennsylvania State University CiteSeerX Archives
مصطلحات موضوعية: Categories and Subject Descriptors, F.1.1 (Computation by Abstract Devices, Models of Computation — computability theory, F.4.1 (Mathematical Logic and Formal Languages, Mathematical Logic — computability theory, proof theory General Terms, Abstract Computability, Algebraic Specification, Computable Analysis, Conditional Equations, Equational Logic, Metric Algebras Additional Key Words and Phrases, Birkhoff’s theorem, Grzegorczyk-Lacombe computability, initial algebras, term models, many-sorted algebras, Mal’cev’s theorem, topological algebras
وصف الملف: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.9470; http://arxiv.org/pdf/cs/0109001v1.pdf
-
2Academic Journal
المؤلفون: Marko Mäkelä, Ab Teknillinen Korkeakoulu, Tekniska Hgskolan, Universite De, Teknillinen Korkeakoulu, Marko Makela, Picaset Oy
المساهمون: The Pennsylvania State University CiteSeerX Archives
مصطلحات موضوعية: many-sorted algebras, algebraic system nets, distributed systems, reachability analysis
وصف الملف: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.6525; http://www.tcs.hut.fi/Publications/bibdb/HUT-TCS-A69.ps.gz
-
3Academic Journal
المؤلفون: Bergstra, J.A., Tucker, J.V.
مصطلحات موضوعية: Wijsbegeerte, Abstract data types, complete term rewriting systems, computable and semicomputable algebras, equational specifications with hidden functions, many sorted algebras, term rewriting systems
وصف الملف: image/pdf
-
4Academic Journal
المؤلفون: J.V. Tucker
المساهمون: The Pennsylvania State University CiteSeerX Archives
مصطلحات موضوعية: abstract data types, computability, many-sorted algebras
وصف الملف: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.5659; http://www.dcss.mcmaster.ca/~zucker/Pubs/FOCS/text.ps
-
5
المؤلفون: Kawamoto, Pauline N., Trybulec, Andrzej
المصدر: 数理解析研究所講究録. 975:176-184
مصطلحات موضوعية: many sorted algebras, modelling of digital circuits, circuit stability
وصف الملف: application/pdf
-
6
المؤلفون: Lei, Wei
Thesis Advisors: Zucker, Jeffery, Computing and Software
مصطلحات موضوعية: error, algebras, computations, many-sorted algebras
الاتاحة: http://hdl.handle.net/11375/21255
-
7
المؤلفون: Marcus Kracht
مصطلحات موضوعية: Predicate logic, Partial algebras, Interpretation (logic), General Computer Science, Computer science, Principle of compositionality, Algebraic logic, Theoretical Computer Science, Algebra, Meaning (philosophy of language), Type theory, Compositionality, Abstract algebraic logic, Many-sorted algebras, Language semantics, Natural language, Computer Science(all)
-
8Academic Journal
المؤلفون: Jian Xu, Jeffery Zucker
المساهمون: The Pennsylvania State University CiteSeerX Archives
مصطلحات موضوعية: models of computation, many-sorted algebras, recursive schemes, recursive procedures
وصف الملف: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.9285; http://www.cas.mcmaster.ca/~xuj5/paper/paper.pdf
-
9
المؤلفون: John V. Tucker, Jan A. Bergstra
المساهمون: Theory of Computer Science (IVI, FNWI)
المصدر: Journal of the Association for Computing Machinery, 42(6), 1194-1230. Association for Computing Machinery (ACM)
Journal of the Association for Computing Machinery, 42(6), 1194. Baltimore, Maryland Association for Computing Machineryمصطلحات موضوعية: Initial algebra, Orthogonality (programming), Abstract data types, computable and semicomputable algebras, equational specifications with hidden functions, Term (logic), Abstract data type, term rewriting systems, Philosophy of language, Algebra, many sorted algebras, Wijsbegeerte, Artificial Intelligence, Hardware and Architecture, Control and Systems Engineering, Completeness (order theory), ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, Rewriting, Algebra over a field, Software, Information Systems, Mathematics, complete term rewriting systems
وصف الملف: image/pdf; application/pdf
-
10Periodical
المؤلفون: Leuştean, Ioana, Moangă, Natalia, Şerbănuţă, Traian Florin
مصطلحات موضوعية: boolean algebras with operators, Jónsson-Tarski theorem, many-sorted algebras, many-sorted logic, operational semantics, Polyadic modal logic
-
11Periodical
المؤلفون: Climent-Vidal, J., Soliveres-Tur, J.
المصدر: Demonstratio Mathematica.
مصطلحات موضوعية: many-sorted algebras, support of a many-sorted algebra, directly irreducible many-sorted algebra, subdirectly irreducible many-sorted algebra, algebra, twierdzenie Birkhoffa
-
12Periodical
المؤلفون: Denecke, K., Lekkoksung, S.
المصدر: Demonstratio Mathematica. Warsaw Technical University Institute of Mathematics.
مصطلحات موضوعية: many-sorted algebras, non-deterministic hypersubstitutions, many-sorted tree language
-
13Periodical
المؤلفون: Mućka, A.
المصدر: Demonstratio Mathematica. Warsaw Technical University Institute of Mathematics.
مصطلحات موضوعية: fibered automata, automata, many-sorted algebras, subdirect product, subdirectly irreducible
-
14Periodical
المؤلفون: Mućka, A.
المصدر: Demonstratio Mathematica. Warsaw Technical University Institute of Mathematics.
مصطلحات موضوعية: fibered automata, automata, many-sorted algebras, subdirect product, subdirectly irreducible
-
15Periodical
المؤلفون: Xu, J., Zucker, J.
المصدر: Annales Societatis Mathematicae Polonae. Series 4: Fundamenta Informaticae.
-
16
المصدر: Journal of the Association for Computing Machinery. 42(6):1194
مصطلحات موضوعية: many sorted algebras, Abstract data types, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, computable and semicomputable algebras, equational specifications with hidden functions, term rewriting systems, complete term rewriting systems
-
17Universality and semicomputability for nondeterministic programming languages over abstract algebras
المؤلفون: Jeffery I. Zucker, Yuan Wang, Wei Jiang
المصدر: The Journal of Logic and Algebraic Programming. (1):44-78
مصطلحات موضوعية: Logic, Computer science, Computation on abstract data types, 0102 computer and information sciences, Computer Science::Computational Complexity, 01 natural sciences, Theoretical Computer Science, law.invention, Turing machine, symbols.namesake, Turing completeness, Computability theory, law, Nondeterminism, 0101 mathematics, Turing, computer.programming_language, Discrete mathematics, Computability, 010102 general mathematics, Guarded commands, Nondeterministic algorithm, Abstract computability, Random assignments, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, 010201 computation theory & mathematics, symbols, Computer Science::Programming Languages, Universal Turing machine, Nondeterministic programming, computer, Many-sorted algebras, Software
-
18Dissertation/ Thesis
المؤلفون: Mäkelä, Marko
المساهمون: Husberg, Nisse, Teknillinen korkeakoulu, Helsinki University of Technology, Tietotekniikan osasto, Ojala, Leo, Aalto-yliopisto, Aalto University
مصطلحات موضوعية: many-sorted algebras, algebraic system nets, distributed systems, reachability analysis, monilajialgebrat, algebralliset järjestelmäverkot, hajautetut järjestelmät, saavutettavuusanalyysi
Relation: https://aaltodoc.aalto.fi/handle/123456789/106053; URN:NBN:fi:aalto-202104145343