In recent research on aphasia, a considerable number of studies have examined deficits in patients with agrammatism in the domain of verb-finiteness marking in different languages. Whilst much of this research has focused on tense and subject-verb agreement and has shown that tense is particularly impaired, the nature of verb-finiteness deficits in agrammatism is still a matter of controversy. ...

According to Hans Kamp and Frank Vlach, the two-dimensional tense operators “now” and “then” are ineliminable in quantified tense logic. This is often adduced as an argument against tense logic, and in favor of an extensional account that makes use of explicit quantification over times. The aim of this paper is to defend tense logic against this attack. It is shown that “now” and “then” are eli...

Examination of a set of non-Bantu Niger-Congo languages shows that most are aspect-prominent languages, that is, they either do not encode tense —the majority case— or, as the quotation indicates, there is reason to think that some have added tense to an original aspectual base. Comparative consideration of tense-aspect categories and morphology suggests that early and Proto-Niger-Congo were as...

I recommend the rule “if in doubt use the present tense”. Higham (1998), [1], §4.29 The present tense works well for scientific writing. The eternal truths we present in an article should all be in the present tense: instead of “experiments have shown that”, prefer “experiments show that”. The present tense helps make more active writing. Write derivations in the present tense: not the past ten...

This research is case study which was designed to investigate the acquisition of tense by Persian and English speaking children between 2to4 years aged. Four girls were precisely analyzed in order to figure how the tense of verbs is effective in their speaking that learners need to succeed in their daily lives. The subjects were randomly selected to study and the matter of gender was not consid...

Game semantics aim at describing the interactive behaviour of proofs by interpreting formulas as games on which proofs induce strategies. In this article, we introduce a game semantics for a fragment of first order propositional logic. One of the main difficulties that has to be faced when constructing such semantics is to make them precise by characterizing definable strategies – that is strat...

This is a summary of the methods and results of a longer paper of the same name which will appear elsewhere. The main result is that an automatic theorem proving system consisting of resolution, paramodulation, factoring, equality reversal, simplification and subsumption removal is complete in first-order logic with equality. When restricted to sets of equality units, the resulting system is ve...

We show how to write generic programs and proofs in MartinLöf type theory. To this end we consider several extensions of MartinLöf’s logical framework for dependent types. Each extension has a universes of codes (signatures) for inductively defined sets with generic formation, introduction, elimination, and equality rules. These extensions are modeled on Dybjer and Setzer’s finitely axiomatized...

The AQUA [16] query algebra allows user-defined equivalence relations as arguments to query operators that generalize standard set operations. These predicates determine what objects are included in the query result, and the duplicates that must be removed. While an expressive enhancement, the use of arbitrary equivalence relations to decide set membership can result in sets with counterintuiti...