The adequacy problem for classical logic. - Jeffery I. Zucker (J. Philos. Log., 1978)

The adequacy problem for inferential logic. - Jeffery I. Zucker; Robert S. Tragesser (J. Philos. Log., 1978)

Denotational Semantics of Concurrency - J. W. de Bakker; Jeffery I. Zucker (STOC, 1982)

Processes and the Denotational Semantics of Concurrency - J. W. de Bakker; Jeffery I. Zucker (Inf. Control., 1982)

Processes and a Fair Semantics for the Ada Rendez-Vous. - J. W. de Bakker; Jeffery I. Zucker (ICALP, 1983)

Compactness in Semantics for Merge and Fair Merge. - J. W. de Bakker; Jeffery I. Zucker (Logic of Programs, 1983)

On Infinite Computations in Denotational Semantics. - J. W. de Bakker; John-Jules Ch. Meyer; Jeffery I. Zucker (Theor. Comput. Sci., 1983)

Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency - J. W. de Bakker; John-Jules Ch. Meyer; Ernst-Rüdiger Olderog; Jeffery I. Zucker (STOC, 1985)

Contrasting Themes in the Semantics of Imperative Concurrency. - J. W. de Bakker; Joost N. Kok; John-Jules Ch. Meyer; Ernst-Rüdiger Olderog; Jeffery I. Zucker (Current Trends in Concurrency, 1986)

Program correctness over abstract data types, with error-state semantics. - John V. Tucker; Jeffery I. Zucker (North-Holland, 1988)

Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform Concurrency. - J. W. de Bakker; John-Jules Ch. Meyer; Ernst-Rüdiger Olderog; Jeffery I. Zucker (J. Comput. Syst. Sci., 1988)

Horn Programs and Semicomputable Relations on Abstract Structures. - John V. Tucker; Jeffery I. Zucker (ICALP, 1989)

Provable Computable Functions on Abstract Data Types. - John V. Tucker; Stanley S. Wainer; Jeffery I. Zucker (ICALP, 1990)

Toward a General Theory of Computation and Specification over Abstract Data Types. - John V. Tucker; Jeffery I. Zucker (ICCI, 1990)

Examples of Semicomputable Sets of Real and Complex Numbers. - John V. Tucker; Jeffery I. Zucker (Constructivity in Computer Science, 1991)

Semantics of Pointers, Referencing and Dereferencing with Intensional Logic - Hing-Kai Hung; Jeffery I. Zucker (LICS, 1991)

Projections of Semicomputable Relations on Abstract Data Tzpes. - John V. Tucker; Jeffery I. Zucker (Int. J. Found. Comput. Sci., 1991)

Theory of Computation over Stream Algebras, and its Applications. - John V. Tucker; Jeffery I. Zucker (MFCS, 1992)

A semantic approach to fairness. - Jan J. M. M. Rutten; Jeffery I. Zucker (Fundam. Informaticae, 1992)

Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types. - John V. Tucker; Jeffery I. Zucker (J. Log. Program., 1992)

Propositional Temporal Logics and Their Use in Model Checking. - Jeffery I. Zucker (Functional Programming, Concurrency, Simulation and Automated Reasoning, 1993)

The Propositional mu-Calculus and Its Use in Model Checking. - Jeffery I. Zucker (Functional Programming, Concurrency, Simulation and Automated Reasoning, 1993)

Transformations of Normal and Inverted Function Tables. - Jeffery I. Zucker (Formal Aspects Comput., 1996)

Tabular Representations in Relational Documents. - Ryszard Janicki; David Lorge Parnas; Jeffery I. Zucker (Relational Methods in Computer Science, 1997)

Computation by 'While' Programs on Topological Partial Algebras. - John V. Tucker; Jeffery I. Zucker (Theor. Comput. Sci., 1999)

Abstract Computability, Algebraic Specification and Initiality - John V. Tucker; Jeffery I. Zucker (CoRR, 2001)

Abstract computability and algebraic specification. - John V. Tucker; Jeffery I. Zucker (ACM Trans. Comput. Log., 2002)

Abstract versus concrete computation on metric partial algebras. - John V. Tucker; Jeffery I. Zucker (ACM Trans. Comput. Log., 2004)

A Network Model of Analogue Computation over Metric Algebras. - John V. Tucker; Jeffery I. Zucker (CiE, 2005)

First and Second Order Recursion on Abstract Data Types. - Jian Xu; Jeffery I. Zucker (Fundam. Informaticae, 2005)

Computable total functions on metric algebras, universal algebraic specifications and dynamical systems. - John V. Tucker; Jeffery I. Zucker (J. Log. Algebraic Methods Program., 2005)

Primitive Recursive Selection Functions over Abstract Algebras. - Jeffery I. Zucker (CiE, 2006)

Universality and semicomputability for nondeterministic programming languages over abstract algebras. - Wei Jiang; Yuan Wang; Jeffery I. Zucker (J. Log. Algebraic Methods Program., 2007)

Computability of analog networks. - John V. Tucker; Jeffery I. Zucker (Theor. Comput. Sci., 2007)

Primitive recursive selection functions for existential assertions over abstract algebras. - Thomas Strahm; Jeffery I. Zucker (J. Log. Algebraic Methods Program., 2008)

Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms. - B. C. Thompson; John V. Tucker; Jeffery I. Zucker (Appl. Math. Comput., 2009)

Continuity of operators on continuous and discrete time streams. - John V. Tucker; Jeffery I. Zucker (Theor. Comput. Sci., 2011)

Assignment Calculus: A Pure Imperative Language. - Marc Bender; Jeffery I. Zucker (LFCS, 2013)

A Class of Contracting Stream Operators. - Nick D. James; Jeffery I. Zucker (Comput. J., 2013)

Computability of Operators on Continuous and Discrete Time Streams. - John V. Tucker; Jeffery I. Zucker (Comput., 2014)

Models of computation for partial functions on the reals. - Ming Quan Fu; Jeffery I. Zucker (J. Log. Algebraic Methods Program., 2015)

Characterizations of semicomputable sets of real numbers. - Bo Xie; Ming Quan Fu; Jeffery I. Zucker (J. Log. Algebraic Methods Program., 2015)

Analog networks on function data streams. - Diogo Poças; Jeffery I. Zucker (Comput., 2018)

Notions of semicomputability in topological algebras over the reals. - Mark Armstrong; Jeffery I. Zucker (Comput., 2019)

Approximability in the GPAC. - Diogo Poças; Jeffery I. Zucker (Log. Methods Comput. Sci., 2019)

Tracking computability of GPAC-generable functions. - Diogo Poças; Jeffery I. Zucker (J. Log. Comput., 2021)