The paper proposes a first approach to systems whose language includes two primitives (>+ and >-) as symbols for factual and counterfactual conditionals which are explicit, i.e. that are stated jointly with the truth or falsity of the antecedent clause. In systems based on this language, here called 2-conditional, the standard corner operator may be defined by (Def>) A > B := (A >+ B)∨(A >- B), while in classical conditional systems one could introduce the two symbols for explicit conditionals by the definitions (Def>+) A >+ B := A∧(A>B) and (Def>-) A>- B := ¬A∧(A>B). Two 2-conditional systems, V² and VW², are axiomatized and proved to be definitionally equivalent to the monoconditional systems V and VW. A third system VWTr² is characterized by an axiom stating the transitivity of factual conditionals and is shown to be distinct from V², from VW² and from the 2-conditional version of Lewis’ well-known system VC, here named VC². The same may be said for a fourth system VW²◊ ±, based on an axiom inderivable in VC²: ◊(A >+ B) ⊃ ◊( ¬A >- ¬B). VC² contains what is here called a “semi-collapse” of the operator >+ and it is argued that it is inadequate as a logic for both factual and counterfactual conditionals. The last section shows that several different definitions of the corner operators in terms of >+ and >- may be introduced as an alternative to (Def>)
