10 papers:
CSL-2008-HodkinsonMS #axiom #logic- Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T (IMH, AM, GS), pp. 308–322.
LICS-2008-ChenF #axiom #equivalence #on the- On the Axiomatizability of Impossible Futures: Preorder versus Equivalence (TC, WF), pp. 156–165.
ICALP-v2-2006-AcetoCFI #axiom #on the- On the Axiomatizability of Priority (LA, TC, WF, AI), pp. 480–491.
- ICALP-2003-BlomFN #axiom #on the #simulation
- On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces (SB, WF, SN), pp. 109–118.
DLT-2001-Kuske #axiom #set- Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable (DK), pp. 206–216.
- ICALP-1995-EsikB #axiom #equation
- Nonfinite Axiomatizability of the Equational Theory of Shuffle (ZÉ, MB), pp. 27–38.
- LICS-1992-Stolboushkin #axiom #finite #linear #modelling #order
- Axiomatizable Classes of Finite Models and Definability of Linear Order (APS), pp. 64–70.
- LICS-1986-Gunter #axiom
- The Largest First-Order-Axiomatizable Cartesian Closed Category of Domains (CAG), pp. 142–148.
PODS-1984-GrahamV #axiom #complexity #consistency #database #on the- On the Complexity and Axiomatizability of Consistent Database States (MHG, MYV), pp. 281–289.
STOC-1979-Berman #axiom #semantics- A Completeness Technique for D-Axiomatizable Semantics (FB), pp. 160–166.
