The following pages link to João Rasga (Q682379):
Displayed 41 items.
- Item:Q682379 (redirect page) (← links)
- Importing logics: soundness and completeness preservation (Q361861) (← links)
- Many-sorted equivalence of shiny and strongly polite theories (Q682380) (← links)
- Importing logics (Q694499) (← links)
- On combined connectives (Q1941724) (← links)
- Event-based time-stamped claim logic (Q2043818) (← links)
- Essential structure of proofs as a measure of complexity (Q2183713) (← links)
- Decidability of logical theories and their combination (Q2204682) (← links)
- Craig interpolation in the presence of unreliable connectives (Q2254572) (← links)
- Fibring as biporting subsumes asymmetric combinations (Q2259004) (← links)
- On probability and logic (Q2413201) (← links)
- Preservation of Craig interpolation by the product of matrix logics (Q2446552) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Completeness and interpolation of almost-everywhere quantification over finitely additive measures (Q2856634) (← links)
- Revisiting the Equivalence of Shininess and Politeness (Q2870128) (← links)
- Fusion of sequent modal logic systems labelled with truth values (Q3061282) (← links)
- Interpolation via translations (Q3184216) (← links)
- ON THE POWER OF QUANTUM TAMPER-PROOF DEVICES (Q3534215) (← links)
- Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification (Q3549314) (← links)
- Truth-values as labels: a general recipe for labelled deduction (Q3643258) (← links)
- A Graph-theoretic Account of Logics (Q3656774) (← links)
- On Graph-theoretic Fibring of Logics (Q3656775) (← links)
- Modulated fibring and the collapsing problem (Q4451732) (← links)
- Fibring Labelled Deduction Systems (Q4542941) (← links)
- Decision and optimization problems in the unreliable-circuit logic (Q4644487) (← links)
- (Q4737137) (← links)
- On meet-combination of logics (Q4902315) (← links)
- (Q4918417) (← links)
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679) (← links)
- Revisiting separation: Algorithms and complexity (Q5020355) (← links)
- Time-stamped claim logic (Q5020357) (← links)
- (Q5119553) (← links)
- (Q5226947) (← links)
- A Roadmap to Decidability (Q5258981) (← links)
- Probabilistic logic of quantum observations (Q5382586) (← links)
- Preservation of Interpolation Features by Fibring (Q5450571) (← links)
- Approximate reasoning about logic circuits with single-fan-out unreliable gates (Q5498867) (← links)
- Modal Sequent Calculi Labelled with Truth Values: Cut Elimination (Q5693112) (← links)
- PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS (Q5737940) (← links)
- Adding abductive reasoning to a propositional logic (Q5866469) (← links)
- Conservative translations revisited (Q6156208) (← links)