Relative definability of boolean functions via hypergraphs
type: Item
instance of: scholarly article
title: Relative definability of boolean functions via hypergraphs
zbMATH Open document ID: 1002.68106
DOI: 10.1016/S0304-3975(00)00332-7
author: Antonio Bucciarelli
author: Pasquale Malacaria
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 1768076
zbMATH Keywords: PCF
zbMATH Keywords: Boolean functions
zbMATH Keywords: degrees of parallelism
describes a project that uses: LCF
MaRDI profile type: Publication
cites work: Full abstraction for PCF
cites work: Q3506860
cites work: Q4160405
cites work: Degrees of parallelism in the continuous type hierarchy
cites work: Sequentiality in an extensional framework
cites work: Parallel and serial hypercoherences
cites work: The system \({\mathcal F}\) of variable types, fifteen years later
cites work: On full abstraction for PCF: I, II and III
cites work: Finitary PCF is not decidable
cites work: Kripke logical relations and PCF
cites work: LCF considered as a programming language
cites work: Q4108313
cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY
cites work: Q3138547
cites work: Interdefinability of parallel operations in PCF
cites work: Mechanizing logical relations
cites work: Q4094390
Recommended article: Hypergraph isomorphism and structural equivalence of Boolean functions
Recommended article: Q4243302
Recommended article: Q3446491
Recommended article: Boolean formulae, hypergraphs and combinatorial topology
Recommended article: Q4305341
Recommended article: On definability of hypergraphs by their semigroups of homomorphisms
Recommended article: Q4246551
Recommended article: Q4949483
Recommended article: Q4282610
Recommended article: Q4936685
description: scientific article; zbMATH DE number 1768076