The following pages link to (Q4039769):
Displaying 16 items.
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case (Q556680) (← links)
- Partial functions and logics: A warning (Q673461) (← links)
- Categorical foundations for structured specifications in \(\mathsf{Z}\) (Q903494) (← links)
- Verifying atomic data types (Q914403) (← links)
- A hidden agenda (Q1575735) (← links)
- A calculus for schemas in Z (Q1583855) (← links)
- Richer types for \(Z\) (Q1816920) (← links)
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (Q1854500) (← links)
- On Automating the Calculus of Relations (Q3541686) (← links)
- Efficient Well-Definedness Checking (Q3541692) (← links)
- Formal verification of multi-agent systems behaviour emerging from cognitive task analysis (Q4467046) (← links)
- R n - and G n -logics (Q4645806) (← links)
- A category theory approach to conceptual data modeling (Q4889816) (← links)
- Functional sorts in data type specifications (Q5055916) (← links)
- Building Specifications in the Event-B Institution (Q5060190) (← links)
- Compositionality: Ontology and Mereology of Domains (Q5187818) (← links)
