Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Zucker, Jeffery - Department of Computing and Software, McMaster University
Computability of analog networks J.V. Tucker
Table Transformation Tools: Why and How 1 H. Shen 2 , J. Zucker 3 , D.L. Parnas 4
The Propositional Calculus and its Use in Model Checking
1 INTRODUCTION We will examine the provability or verifiability in formal systems of pro
Semantics of Pointers, Referencing and Dereferencing with Intensional Logic
Toward a General Theory of Computation and Specification over Abstract Data Types
Provable Computable Selection Functions on Abstract Structures
PROJECTIONS OF SEMICOMPUTABLE RELATIONS ON ABSTRACT DATA TYPES
Fundamenta Informaticae XXI (2004) 143 1 First and Second Order Recursion on Abstract Data Types
Primitive Recursive Selection Functions for Existential Assertions over Abstract Algebras
A Network Model of Analogue Computation over Metric Algebras
Abstract versus Concrete Computation on Metric Partial Algebras J.V. Tucker
Appendix A: W-continuity Recall our definition (2.5.1) of continuity of partial functions: f : X
Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
Propositional Temporal Logics and their Use in Model Checking
Universality and Semicomputability for Nondeterministic Programming
Introduction to Computability Theory Jeffery Zucker \Lambda
Tabular Representations in Relational Ryszard Janicki, David Lorge Parnas, Jeffery Zucker 1
Continuity of Operators on Continuous and Discrete Time Streams J.V. Tucker
