On asymptotic divergency in equivalential logics
From MaRDI portal
Publication:5458069
DOI10.1017/S0960129507006391zbMATH Open1136.03008OpenAlexW2134383339MaRDI QIDQ5458069FDOQ5458069
Authors: Zofia Kostrzycka
Publication date: 10 April 2008
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129507006391
Recommendations
Cites Work
Cited In (6)
- Title not available (Why is that?)
- Some remarks on equivalence in infinitary and stationary logic
- Asymptotic density for equivalence
- The fraction of large random trees representing a given Boolean function in implicational logic
- Complexity and Limiting Ratio of Boolean Functions over Implication
- Axiomatising divergence
This page was built for publication: On asymptotic divergency in equivalential logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458069)