Results 231 to 240 of about 506,932 (281)

Robust direct voltage control of stand-alone DFIG wind systems using a fractional-order fuzzy logic approach. [PDF]

open access: yesSci Rep
Boucetta F   +7 more
europepmc   +1 more source

A normalization-procedure for the first order classical natural deduction with full logical symbols

open access: yesA normalization-procedure for the first order classical natural deduction with full logical symbols
openaire   +1 more source

Dual Tableau for Classical First-Order Logic

2010
In [RS60] Rasiowa and Sikorski developed a deduction system for classical first-order logic without identity. Their aim was to present a system which is a realization of the Beth idea of the analytic tableau [Bet59] and, in contrast with the Gentzen system [Gen34] which required the cut rule in the proof of completeness, was cut free.
Ewa Orłowska, Joanna Golińska-Pilarek
openaire   +1 more source

Semantics of Non-Classical First Order Predicate Logics

1990
To describe semantics of a logical system one should define notions of a model and the truth in a model. A major part of classical first order model theory can be developed within the standard semantics, while alternative types of semantics (such as sheaves, forcing, polyadic algebras) play an auxiliary role.
Valentin Shehtman, Dmitrij Skvortsov
openaire   +1 more source

FIBRED ALGEBRAIC SEMANTICS FOR A VARIETY OF NON-CLASSICAL FIRST-ORDER LOGICS AND TOPOLOGICAL LOGICAL TRANSLATION

The Journal of Symbolic Logic, 2021
AbstractLawvere hyperdoctrines give categorical algebraic semantics for intuitionistic predicate logic. Here we extend the hyperdoctrinal semantics to a broad variety of substructural predicate logics over the Typed Full Lambek Calculus, verifying their completeness with respect to the extended hyperdoctrinal semantics.
openaire   +1 more source

On One Approach to Goal-Driven Proof Search in Classical First-Order Logic

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2020
An approach to a computer-oriented proof search in classical first-order logic leading to the construction of goal-driven sequent calculi that do not require skolemzation and one of which is a quantifier-rules-free one is presented. Results about the soundness and completeness of proposed sequent calculi are obtained through establishing their ...
Alexander Lyaletski, Alexandre Lyaletsky
openaire   +1 more source

How game-theoretical semantics works: Classical first-order logic

Erkenntnis, 1988
The structure of strategies for semantical games is studied by means of a new formalism developed for the purpose. Rigorous definitions of strategy, winning strategy, truth, and falsity are presented. Non-contradiction and bivalence are demonstrated for the truth-definition.
openaire   +1 more source

Home - About - Disclaimer - Privacy