The most common type of modal testing system today uses an FFT analyzer to measure a set of Frequency Response Functions (FRFs) from a structure, and then uses a parameter estimation (curve fitting) method to determine the structure’s modal properties from the FRF measurements. The curve fitting method typically “fits” an analytical model to the FRF data, (or its equivalent Impulse Response dat...

Random generation of modal formulae is a viable method for generating problems for benchmarking modal decision procedures. However, previous work in this area has used a flawed generator that has resulted in questionable results. Fixing the generator changes the characteristics of the generated problems. The fixed generator can be used to generate hard problems that have more interesting modal ...

This paper is a survey on modal logic of multiverses. It summarizes known results by Hamkins, Inamdar, Leibman, and the second author about the modal logics of forcing, grounds, and inner models in a general abstract setting. Most results in this survey come from a series of papers co-authored by the second author [19, 20, 18, 24]. Exceptions are the discussion of spiked Boolean algebras and th...

Research on within-modal repetition priming suggests that this form of implicit memory is preserved in older adults not only for visual stimuli but also for stimuli presented to other perceptual modalities (e.g., touch, audition, and olfaction). Fewer studies, however, have examined whether priming is modality specific. Studies conducted with young adults have shown that cross-modal (vision-to-...

We introduce a family of modal expansions of Belnap-Dunn four-valued logic and related systems, and interpret them in many-valued Kripke structures. Using algebraic logic techniques and topological duality for modal algebras, and generalizing the so-called twist-structure representation, we axiomatize by means of Hilbert-style calculi the least modal logic over the four-element Belnap lattice a...

THINKER is an automated natural deduction first-order theorem proving program. This paper reports on how it was adapted so as to prove theorems in modal logic. The method employed is an "indirect semantic method", obtained by considering the semantic conditions involved in being a valid argument in these modal logics. The method is extended from propositional modal logic to predicate modal logi...

Topic of the present paper is the modal approach to conditionals. We will distinguish two versions of the modal approach: a weak version which is the one that has been introduced by Kratzer (Kratzer [1977, 1979, 1981]) and a strong version that is the way the modal approach is presently used in many approaches to conditionals. In the second part of the paper we will present some arguments again...

Modal Profile Analysis was used to cluster students (aged 9 to 14 years) on 16 subtest scores from the Halstead-Reitan Neuropsychological Battery for Children (HRNB-C). This analysis produced eight modal profile types, all of which were replicated in multiple samples. An initial attempt to establish external validity indicated that the modal groups display dissimilar patterns of performance on ...

Multi-modal test execution allows execution of the same test against various layers and components of a software system. This paper presents a method that effectively encodes one-to-many test definition and test execution relationship of multi-modal functional tests without creating large test maintenance overhead. Our approach extends the Fit table specification structure by multi-modal fixtur...

The modal logic S4 can be used via a Curry-Howard style correspondence to obtain a λcalculus. Modal (boxed) types are intuitively interpreted as ‘closed syntax of the calculus’. This λ-calculus is called modal type theory — this is the basic case of a more general contextual modal type theory, or CMTT. CMTT has never been given a denotational semantics in which modal types are given denotation ...