|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-540-33340-1 |
003 |
DE-He213 |
005 |
20230406001124.0 |
007 |
cr nn 008mamaa |
008 |
100301s2006 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540333401
|9 978-3-540-33340-1
|
024 |
7 |
|
|a 10.1007/11734673
|2 doi
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a COM014000
|2 bisacsh
|
072 |
|
7 |
|a UYA
|2 thema
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
245 |
1 |
0 |
|a Relational Methods in Computer Science
|h [electronic resource] :
|b 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 22-26, 2005, Selected Revised Papers /
|c edited by Wendy MacCaull, Michael Winter, Ivo Düntsch.
|
250 |
|
|
|a 1st ed. 2006.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
300 |
|
|
|a VIII, 262 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3929
|
505 |
0 |
|
|a Invited Papers -- Topological Representation of Precontact Algebras -- Relational Semantics Through Duality -- Duality Theory for Projective Algebras -- Contributed Papers -- Relational Approach to Boolean Logic Problems -- Static Analysis of Programs Using Omega Algebra with Tests -- Weak Contact Structures -- On Relational Cycles -- A Framework for Kleene Algebra with an Embedded Structure -- Non-termination in Unifying Theories of Programming -- Towards an Algebra of Hybrid Systems -- Relational Correspondences for Lattices with Operators -- Control-Flow Semantics for Assembly-Level Data-Flow Graphs -- Relational Implementation of Simple Parallel Evolutionary Algorithms -- Lattice-Based Paraconsistent Logic -- Verification of Pushdown Systems Using Omega Algebra with Domain -- wp Is wlp -- Relational Representability for Algebras of Substructural Logics -- Knuth-Bendix Completion as a Data Structure -- Quantifier Elimination in Elementary Set Theory -- Time-Dependent Contact Structures in Goguen Categories.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Machine theory.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Computer science-Mathematics.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
1 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
650 |
2 |
4 |
|a Software Engineering.
|
650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
650 |
2 |
4 |
|a Artificial Intelligence.
|
700 |
1 |
|
|a MacCaull, Wendy.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Winter, Michael.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Düntsch, Ivo.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540822547
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540333395
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3929
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11734673
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|