Results 281 to 290 of about 1,320,893 (348)

Reframing and Taming Uncertainty: A Qualitative Study on Self‐Affirmation Interventions for Supporting Coping With Entrepreneurs' Insecurity

open access: yesStrategic Change, EarlyView.
ABSTRACT Self‐affirmation interventions (SAIs) have garnered increasing interest from both practitioners and scholars due to their potential to help working adults cope with uncertainty and job insecurity. This interest is particularly relevant for entrepreneurs, who frequently face high levels of uncertainty and lack the organizational support ...
Alexandra Jussli, Martin Schwarz
wiley   +1 more source

The Application of a Cost Management System Within the Changing Dynamics of Organisations

open access: yesStrategic Change, EarlyView.
ABSTRACT Contingency theory suggests that cost‐management systems (CMS) must be aligned with organizational and environmental characteristics; however, empirical evidence remains fragmented and is drawn largely from advanced economies. It remains unclear whether the importance of specific contingent factors varies when digital infrastructure, capital ...
Padmi Nagirikandalage   +5 more
wiley   +1 more source

The Propositional Formula Checker HeerHugo [PDF]

open access: possibleJournal of Automated Reasoning, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joost P. Warners, Jan Friso Groote
openaire   +2 more sources

Reducing signed propositional formulas

Soft Computing - A Fusion of Foundations, Methodologies and Applications, 1999
New strategies of reduction for finite-valued propositional logics are introduced in the framework of the TAS1 methodology developed by the authors [1]. A new data structure, the Δ^-sets, is introduced to store information about the formula being analysed, and its usefulness is shown by developing efficient strategies to decrease the size of signed ...
Gabriel Aguilera   +3 more
openaire   +2 more sources

On the recognition of the tautological nature of propositional formulas [PDF]

open access: possibleJournal of Soviet Mathematics, 1980
A formal language whose propositions express (in some sense) the properties of propositional formulas is described in the paper. For a certain subset of propositions of this language it is proved that each of them defines a class of propositional formulas, on which it is possible to recognize the tautological nature in a time polynomially dependent on ...
openaire   +1 more source

Classification of derivable propositional formulas

Mathematical Notes of the Academy of Sciences of the USSR, 1972
This article considers questions connected with the derivability of propositional formulas under restrictions on the length of the derivation. A classification is proposed for formulas with minimum derivation length.
openaire   +3 more sources

Home - About - Disclaimer - Privacy