The following pages link to Ana Teresa Martins (Q654909):
Displayed 22 items.
- Recursive definitions and fixed-points on well-founded structures (Q654910) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- Parameterized complexity of some prefix-vocabulary fragments of first-order logic (Q1799280) (← links)
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT (Q2003999) (← links)
- Some aspects of the database resilience (Q2119956) (← links)
- A two-level approach based on model checking to support architecture conformance checking (Q2154043) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank (Q2333677) (← links)
- Full classical S5 in natural deduction with weak normalization (Q2478553) (← links)
- An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models (Q2866740) (← links)
- Hybrid Logics and NP Graph Properties (Q3003354) (← links)
- (Q3112293) (← links)
- Expressible preferential logics (Q3165754) (← links)
- (Q3384892) (← links)
- Natural deduction for the finite least fixed point logic with an infinitary rule (Q3644843) (← links)
- (Q4440561) (← links)
- Natural Deduction and Weak Normalization for Full Linear Logic (Q4656555) (← links)
- (Q5067948) (← links)
- (Q5116418) (← links)
- Recursive Definitions and Fixed-Points (Q5178958) (← links)
- The Descriptive Complexity of the Deterministic Exponential Time Hierarchy (Q5179012) (← links)
- On Minimal Models (Q5436989) (← links)