The paper [3] started a new approach to Abstract Algebraic Logic in which, instead of the usual equivalence-based classification of logical systems leading to the well-known Leibniz hierarchy of protoalgebraic logics (see [5]), we proposed an alternative setting based on implication connectives. By studying the properties of weak p-implications (understood as generalized connectives defined by ...

Implicit discourse relation classification is of great challenge due to the lack of connectives as strong linguistic cues, which motivates the use of annotated implicit connectives to improve the recognition. We propose a feature imitation framework in which an implicit relation network is driven to learn from another neural network with access to connectives, and thus encouraged to extract sim...

Discourse connectives can often signal multiple discourse relations, depending on their context. The automatic identification of the Arabic translations of seven English discourse connectives shows how these connectives are differently translated depending on their actual senses. Automatic labelling of English source connectives can help a machine translation system to translate them more corre...

This paper is an attempt to clarify the status of discourse markers. These lexical expressions have been studied under various labels, including discourse markers, discourse connectives, discourse operators, pragmatic connectives, sentence connectives, and cue phrases. Although most researchers agree that they are expressions which relate discourse segments, there is no agreement on how they ar...

We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More precisely, we will be interested in checking whether an axiomatization for Classical Propositional Logic may be produced by merging Hilbert-style calculi for tw...

While ∧,∨,¬ form a complete set of connectives for classical propositional logic, this does not hold for Łukasiewicz’s three-valued propositional logic, nor its generalization to n-valued logic. We define a unary connective r so that ∧,∨,¬, r form a complete set of connectives for n-valued Łukasiewicz logic. We discuss generalizations of this to infinitary logics. If we allow infinite conjuncti...

The paper tries to contribute to the general definition of discourse connectives. It examines connectives in broader sense, i.e. all language expressions that have an ability to express discourse relations within a text (e.g. both conjunctions like but, and, or and expressions like the condition for this is, due to this situation etc.). The paper tries to classify connectives from different per...

Of the common commutative binary logical connectives, only and and ormay be used as operators that take arbitrary numbers of arguments with order and multiplicity being irrelevant, that is, as connectives that take sets of arguments. This is especially evident in the Common Logic Interchange Format, in which it is easy for operators to be given arbitrary numbers of arguments. The reason is that...