The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “A system for deduction-based formal verification of workflow-oriented software models”

Computational logics and the philosophy of language: the problem of lexical meaning in formal semantics.

Marcello Frixione (1996)

Mathware and Soft Computing

Similarity:

This paper deals with the possible contributions that logical researches carried on in the field of artificial intelligence (AI) could give to formal theories of meaning developed by logically oriented philosophers of language within the tradition of analytic philosophy. In particular, I will take into account a topic which is problematic in many respects for traditional logical accounts of meaning, i.e., the problem of lexical semantics. My thesis is that AI logics could give useful...

Propositional Linear Temporal Logic with Initial Validity Semantics1

Mariusz Giero (2015)

Formalized Mathematics

Similarity:

In the article [10] a formal system for Propositional Linear Temporal Logic (in short LTLB) with normal semantics is introduced. The language of this logic consists of “until” operator in a very strict version. The very strict “until” operator enables to express all other temporal operators. In this article we construct a formal system for LTLB with the initial semantics [12]. Initial semantics means that we define the validity of the formula in a model as satisfaction in the initial...

Inference in Action

Johan van Benthem (2007)

Publications de l'Institut Mathématique

Similarity:

The Axiomatization of Propositional Logic

Mariusz Giero (2016)

Formalized Mathematics

Similarity:

This article introduces propositional logic as a formal system ([14], [10], [11]). The formulae of the language are as follows φ ::= ⊥ | p | φ → φ. Other connectives are introduced as abbrevations. The notions of model and satisfaction in model are defined. The axioms are all the formulae of the following schemes α ⇒ (β ⇒ α), (α ⇒ (β ⇒ γ)) ⇒ ((α ⇒ β) ⇒ (α ⇒ γ)), (¬β ⇒ ¬α) ⇒ ((¬β ⇒ α) ⇒ β). Modus ponens is the only derivation rule. The soundness theorem and the strong completeness theorem...

Semantical Proof of Subformula Property for the Modal Logics K4.3, KD4.3, and S4.3

Daishi Yazaki (2019)

Bulletin of the Section of Logic

Similarity:

The main purpose of this paper is to give alternative proofs of syntactical and semantical properties, i.e. the subformula property and the nite model property, of the sequent calculi for the modal logics K4.3, KD4.3, and S4.3. The application of the inference rules is said to be acceptable, if all the formulas in the upper sequents are subformula of the formulas in lower sequent. For some modal logics, Takano analyzed the relationships between the acceptable inference rules and semantical...

The Dynamic Epistemic Logic for Actual Knowledge

Arkadiusz Wójcik (2020)

Bulletin of the Section of Logic

Similarity:

The dynamic epistemic logic for actual knowledge models the phenomenon of actual knowledge change when new information is received. In contrast to the systems of dynamic epistemic logic which have been discussed in the past literature, our system is not burdened with the problem of logical omniscience, that is, an idealized assumption that the agent explicitly knows all classical tautologies and all logical consequences of his or her knowledge. We provide a sound and complete axiomatization...

Cocktail: a tool for deriving correct programs.

Michael Franssen, Harrie De Swart (2004)

RACSAM

Similarity:

Cocktail is a tool for deriving correct programs from their specifications. The present version is powerful enough for educational purposes. The tool yields support for many sorted first order predicate logic, formulated in a pure type system with parametric constants (CPTS), as the specification language, a simple While-language, a Hoare logic represented in the same CPTS for deriving programs from their specifications and a simple tableau based automated theorem prover for verifying...

Universality of Logic

Jan Woleński (2017)

Bulletin of the Section of Logic

Similarity:

This paper deals with the problem of universality property of logic. At first, this property is analyzed in the context of first-order logic. Three senses of the universality property are distinguished: universal applicability, topical neutrality and validity (truth in all models). All theses senses can be proved to be justified. The fourth understanding, namely the amount of expressive power, is connected with the criticism of the first-order thesis: first-order logic is the logic....

On some properties of grounding nonuniform sets of modal conjunctions

Radoslaw Katarzyniak (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

A language grounding problem is considered for nonuniform sets of modal conjunctions consisting of conjunctions extended with more than one modal operator of knowledge, belief or possibility. The grounding is considered in the context of semiotic triangles built from language symbols, communicative cognitive agents and external objects. The communicative cognitive agents are assumed to be able to observe external worlds and store the results of observations in internal knowledge bases....