Partial Order Reduction (POR) techniques improve the basic model checking algorithm by reducing the numbers of states and transitions explored in verifying a property of the model. In the “ample set” POR framework for the verification of an LTL−X formula φ, one associates to each state s a subset Ts of the set of all transitions enabled at s. The approach requires that whenever Ts is a proper s...

Propositional truth-value can be a defining feature of a sentence's relevance to the unfolding discourse, and establishing propositional truth-value in context can be key to successful interpretation. In the current study, we investigate its role in the comprehension of counterfactual conditionals, which describe imaginary consequences of hypothetical events, and are thought to require keeping ...

Partial Order Reduction (POR) techniques improve the basic model checking algorithm by reducing the numbers of states and transitions explored in verifying a property of the model. In the “ample set” POR framework for the verification of an LTL −X formula φ, one associates to each state s a subset Ts of the set of all transitions enabled at s. The approach requires that whenever Ts is a proper ...

In I Kings 22, a lying spirit deceives King Ahab’s prophets into prophesying in unison success in battle. This strange and tragic story enlarges the category of false prophets to include those who are sincere yet mistaken. This biblical report of one of many clashes between true and false prophets offers a conceptually powerful tool for thinking through the human capacity and obligation to disc...

Scientists and Bayesian statisticians often study hypotheses that they know to be false. This creates an interpretive problem because the Bayesian probability of a hypothesis is supposed to represent the probability that the hypothesis is true. I investigate whether Bayesianism can accommodate the idea that false hypotheses are sometimes approximately true or that some hypotheses or models can ...

Graph normal form, GNF, [1], was used in [2, 3] for analysing paradoxes in propositional discourses, with the semantics – equivalent to the classical one – defined by kernels of digraphs. The paper presents infinitary, resolution-based reasoning with GNF theories, which is refutationally complete for the classical semantics. Used for direct (not refutational) deduction it is not explosive and a...

According to Austin, in uttering I hereby X in a performative we are neither asserting nor saying anything true/false-assessable about what we are doing, our Xing. Still in producing the performative utterance we can be said to say we are Xing. So, we have the production of a declarative sentence, that is perfectly meaningful and not lacking in content in any way, that is nevertheless not produ...

In this article, I focus on defective conditionals, namely indicative conditionals whose antecedent is false and whose truth-value therefore cannot be determined. The problem is to decide which formal connective can adequately represent this usage. Classical logic renders defective conditionals true whereas traditional mathematics dismisses them as irrelevant. This difference in treatment entai...

A formula is a contingent logical truth when it is true in every model M but, for some model M , false at some world of M . We argue that there are such truths, given the logic of actuality. Our argument turns on defending Tarski’s definition of truth and logical truth, extended so as to apply to modal languages with an actuality operator. We argue that this extension is the philosophically pro...