Pages that link to "Item:Q5267436"
From MaRDI portal
The following pages link to Eliminating definitions and Skolem functions in first-order logic (Q5267436):
Displaying 11 items.
- The complexity of higher-order queries (Q498405) (← links)
- Skolem functions of arithmetical sentences. (Q1427862) (← links)
- Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \) (Q2144618) (← links)
- A unifying principle for clause elimination in first-order logic (Q2405255) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- On the complexity of proof deskolemization (Q2892685) (← links)
- Non-elementary speed-ups in logic calculi (Q3545216) (← links)
- Forcing in Proof Theory (Q4678943) (← links)
- Effective Interpolation and Preservation in Guarded Logics (Q5277909) (← links)
- Constructive forcing, CPS translations and witness extraction in Interactive realizability (Q5360214) (← links)
- Finitely axiomatized theories lack self‐comprehension (Q6051417) (← links)